Theorems · Inductive type · order theory
IsWellOrder
(α : Type u) → (α → α → Prop) → Prop
A well order is a well-founded linear order.
- Defined in
- Mathlib.Order.RelClasses
- Cited by
- 171 results in Mathlib
- Foundations
- Depth 0 from the axioms, rests on 1 definitions · uses no axioms
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 by195
Results whose statement or proof uses this declaration.
- Cardinal.ordproof · cited by 266
- Ordinal.typestatement and proof · cited by 207
- Ordinal.typeinstatement and proof · cited by 60
- Ordinal.enumstatement and proof · cited by 39
- Ordinal.type_toTypestatement · cited by 28
- Cardinal.card_ordproof · cited by 23
- Cardinal.mul_eq_selfproof · cited by 13
- Ordinal.typein_enumstatement and proof · cited by 13
- Ordinal.typein_lt_typestatement and proof · cited by 13
- Ordinal.lift_id'proof · cited by 10
- Ordinal.bfamilyOfFamily'statement and proof · cited by 10
- Ordinal.card_le_cardproof · cited by 10