Theorems · Theorem · order theory
Set.isPWO_iff_isWF
∀ {α : Type u_2} [inst : LinearOrder α] {s : Set α}, s.IsPWO ↔ s.IsWFIn a linear order, the predicates Set.IsPWO and Set.IsWF are equivalent.
- Defined in
- Mathlib.Order.WellFoundedSet
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 87 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.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- LinearOrderstatement and proof · cited by 8,572
- Set.IsPWOstatement · cited by 99
- Set.IsWFstatement · cited by 47
- WellQuasiOrderedLEproof · cited by 22
- IsWellFoundedproof · cited by 18
- isWellFounded_iffproof · cited by 9
- wellQuasiOrderedLE_defproof · cited by 2
- wellQuasiOrderedLE_iff_wellFoundedLTproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Set.IsWF.isPWOproof · cited by 13