Theorems · Theorem · order theory
wellQuasiOrderedLE_iff_wellFoundedLT
∀ {α : Type u_1} [inst : LinearOrder α], WellQuasiOrderedLE α ↔ WellFoundedLT αA linear WQO is the same thing as a well-order.
- Defined in
- Mathlib.Order.WellQuasiOrder
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 86 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- LinearOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setproof · cited by 53,352
- LinearOrderstatement and proof · cited by 8,572
- WellFoundedLTstatement and proof · cited by 491
- IsAntichainproof · cited by 105
- WellQuasiOrderedLEstatement · cited by 22
- Set.Subsingleton.finiteproof · cited by 20
- IsAntichain.subsingletonproof · cited by 1
- wellQuasiOrderedLE_iffproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Set.isPWO_iff_isWFproof · cited by 1