Theorems · Theorem · logic and foundations
Ordinal.lift_type_eq
∀ {α : Type u} {β : Type v} {r : α → α → Prop} {s : β → β → Prop} [inst : IsWellOrder α r] [inst_1 : IsWellOrder β s],
Ordinal.lift.{max v w, u} (Ordinal.type r) = Ordinal.lift.{max u w, v} (Ordinal.type s) ↔ Nonempty (r ≃r s)- Defined in
- Mathlib.SetTheory.Ordinal.Basic
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 30 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- IsWellOrderIsWellOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Ordinalstatement · cited by 1,688
- RelIsostatement and proof · cited by 456
- Ordinal.typestatement · cited by 207
- RelIso.symmproof · cited by 193
- IsWellOrderstatement and proof · cited by 171
- Equiv.uliftproof · cited by 115
- Ordinal.liftstatement · cited by 86
- Order.Preimageproof · cited by 42
- RelIso.transproof · cited by 18
- Quotient.eq'proof · cited by 14
- RelIso.preimageproof · cited by 12
- WellOrder.rproof · cited by 8
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.