Theoremcore
Dilworth's theorem
Also called chain-antichain theorem.
In a finite partially ordered set, the largest antichain equals the minimum number of chains covering it.
In a finite partially ordered set, the largest antichain equals the minimum number of chains covering it.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag EVVF4C Edit this page History Report an error