Theorems · Inductive type · logic and foundations
WellOrder
Type (u + 1)
Bundled structure registering a well order on a type. Ordinals will be defined as a quotient of this type.
- Defined in
- Mathlib.SetTheory.Ordinal.Basic
- Cited by
- 12 results in Mathlib
- Foundations
- Depth 0 from the axioms · 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 by22
Results whose statement or proof uses this declaration.
- Ordinal.liftproof · cited by 86
- WellOrder.rstatement and proof · cited by 8
- Ordinal.inductionOnproof · cited by 8
- Ordinal.lift_addproof · cited by 6
- WellOrder.αstatement and proof · cited by 5
- Ordinal.inductionOn₂proof · cited by 4
- Ordinal.card_mulproof · cited by 3
- WellOrder.mk.injstatement · cited by 1
- WellOrder.mk.noConfusionstatement · cited by 1
- Ordinal.liftOnWellOrderproof · cited by 1
- Ordinal.liftOnWellOrder_typeproof · cited by 1
- Ordinal.lt_wfproof · cited by 1