Theorems · Theorem · order theory
IsAntichain.finite_of_wellQuasiOrdered
∀ {α : Type u_1} {r : α → α → Prop} {s : Set α}, IsAntichain r s → WellQuasiOrdered r → s.Finite- Defined in
- Mathlib.Order.WellQuasiOrder
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 81 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites10
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Setstatement and proof · cited by 53,352
- Set.Finitestatement and proof · cited by 1,814
- LT.lt.neproof · cited by 872
- Subtype.val_injectiveproof · cited by 232
- Function.Embedding.injectiveproof · cited by 111
- IsAntichainstatement and proof · cited by 105
- WellQuasiOrderedstatement and proof · cited by 15
- IsAntichain.eqproof · cited by 13
- Set.Infinite.natEmbeddingproof · cited by 10
Cited by1
Results whose statement or proof uses this declaration.
- WellQuasiOrderedLE.finite_of_isAntichainproof · cited by 1