Theorems · Theorem · logic and foundations

Ordinal.enum_type

∀ {α β : Type u_1} {r : α → α → Prop} {s : β → β → Prop} [inst : IsWellOrder α r] [inst_1 : IsWellOrder β s]
  (f : PrincipalSeg s r) {h : Ordinal.type s < Ordinal.type r}, (Ordinal.enum r) ⟨Ordinal.type s, h⟩ = f.top

Defined in

Mathlib.SetTheory.Ordinal.Basic

Cited by

2 results in Mathlib

Foundations

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

Assumes

IsWellOrderIsWellOrder