Theorems · Theorem · logic and foundations

RelIso.ordinalType_congr

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

Defined in

Mathlib.SetTheory.Ordinal.Basic

Cited by

7 results in Mathlib

Foundations

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

Assumes

IsWellOrderIsWellOrder