Theorems · Theorem · logic and foundations

Ordinal.type_eq

∀ {α β : Type u_1} {r : α → α → Prop} {s : β → β → Prop} [inst : IsWellOrder α r] [inst_1 : IsWellOrder β s],
  Ordinal.type r = Ordinal.type s ↔ Nonempty (r ≃r s)

Defined in

Mathlib.SetTheory.Ordinal.Basic

Cited by

3 results in Mathlib

Foundations

Depth 28 from the axioms · uses propext, Quot.sound

Assumes

IsWellOrderIsWellOrder