Theorems · Theorem · logic and foundations

RelEmbedding.ordinal_type_le

∀ {α β : 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

3 results in Mathlib

Foundations

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

Assumes

IsWellOrderIsWellOrder