Mathlib Map

Theorems · Theorem · logic and foundations

Ordinal.typein_surj

∀ {α : Type u} (r : α → α → Prop) [inst : IsWellOrder α r] {o : Ordinal.{u}},
  o < Ordinal.type r → o ∈ Set.range ⇑(Ordinal.typein r).toRelEmbedding
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
IsWellOrder
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cardinal.mul_eq_self · cited by 13Cardinal.mul_eq_selfDFunLike.coe · cited by 62936DFunLike.coeSet · cited by 53352SetSet.range · cited by 4705Set.rangeOrdinal · cited by 1688OrdinalRelEmbedding · cited by 281RelEmbeddingOrdinal.type · cited by 207Ordinal.typeIsWellOrder · cited by 171IsWellOrderPrincipalSeg.toRelEmbedding · cited by 129PrincipalSeg.toRelEmbeddi…Ordinal.typein · cited by 60Ordinal.typeinPrincipalSeg.mem_range_of_rel_top · cited by 5PrincipalSeg.mem_range_of…Ordinal.typein_surjCITED BYCITES

Cites10

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.