Theorems · Inductive type · order theory
WellQuasiOrderedLE
(α : Type u_3) → [LE α] → Prop
A typeclass for an order with a well-quasi-ordered ≤ relation.
Note that this is unlike WellFoundedLT, which instead takes a < relation.
- Defined in
- Mathlib.Order.WellQuasiOrder
- Cited by
- 22 results in Mathlib
- Foundations
- Depth 1 from the axioms · uses no axioms
- Assumes
- LE
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites0
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Nothing in Mathlib beyond the foundations.
Cited by24
Results whose statement or proof uses this declaration.
- Set.isPWO_of_wellQuasiOrderedLEstatement and proof · cited by 4
- Submonoid.fg_of_divisivestatement and proof · cited by 2
- wellQuasiOrdered_lestatement and proof · cited by 2
- WellQuasiOrdered.wellFoundedproof · cited by 2
- WellQuasiOrderedLE.wqostatement and proof · cited by 2
- AddSubmonoid.fg_of_subtractivestatement and proof · cited by 2
- wellQuasiOrderedLE_defstatement and proof · cited by 2
- WellQuasiOrderedLE.casesOnstatement and proof · cited by 1
- WellQuasiOrderedLE.finite_of_isAntichainstatement and proof · cited by 1
- Monotone.wellQuasiOrderedLE_of_wellQuasiOrderedLE_of_surjectivestatement and proof · cited by 1
- Set.isPWO_iff_isWFproof · cited by 1
- wellQuasiOrderedLE_iffstatement and proof · cited by 1