Theorems · Theorem · logic and foundations

Ordinal.typein_top

∀ {α β : Type u_1} {r : α → α → Prop} {s : β → β → Prop} [inst : IsWellOrder α r] [inst_1 : IsWellOrder β s]
  (f : PrincipalSeg r s), (Ordinal.typein s).toRelEmbedding f.top = Ordinal.type r

Defined in

Mathlib.SetTheory.Ordinal.Basic

Cited by

1 results in Mathlib

Foundations

Depth 36 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

IsWellOrderIsWellOrder