Theorems · Theorem · order theory
RelIso.wellQuasiOrdered_iff
∀ {α : Type u_3} {β : Type u_4} {r : α → α → Prop} {s : β → β → Prop} (f : r ≃r s),
WellQuasiOrdered r ↔ WellQuasiOrdered s- Defined in
- Mathlib.Order.WellQuasiOrder
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 23 from the axioms · uses propext, Classical.choice, Quot.sound
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.
- DFunLike.coeproof · cited by 62,936
- RelIsostatement and proof · cited by 456
- Equiv.reflproof · cited by 274
- EquivLike.toEquivproof · cited by 125
- Equiv.forall_congrproof · cited by 22
- Equiv.arrowCongrproof · cited by 20
- RelIso.map_rel_iffproof · cited by 17
- WellQuasiOrderedstatement · cited by 15
- Equiv.arrowCongr_applyproof · cited by 4
Cited by2
Results whose statement or proof uses this declaration.
- Set.partiallyWellOrderedOn_univ_iffproof · cited by 2
- OrderIso.wellQuasiOrderedLE_iffproof · cited by 0