Theorems · Theorem · order theory
wellQuasiOrderedLE_def
∀ (α : Type u_3) [inst : LE α], WellQuasiOrderedLE α ↔ WellQuasiOrdered fun x1 x2 => x1 ≤ x2
- Defined in
- Mathlib.Order.WellQuasiOrder
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses no axioms
- Assumes
- LE
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- WellQuasiOrderedLEstatement and proof · cited by 22
- WellQuasiOrderedstatement and proof · cited by 15
- WellQuasiOrderedLE.casesOnproof · cited by 1
Cited by2
Results whose statement or proof uses this declaration.
- Set.isPWO_iff_isWFproof · cited by 1
- Set.isPWO_univ_iffproof · cited by 0