Theorems · Theorem · logic and foundations
Ordinal.enum_typein
∀ {α : Type u} (r : α → α → Prop) [inst : IsWellOrder α r] (a : α),
(Ordinal.enum r) ⟨(Ordinal.typein r).toRelEmbedding a, ⋯⟩ = a- Defined in
- Mathlib.SetTheory.Ordinal.Basic
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 39 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- IsWellOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites15
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coestatement · cited by 62,936
- Setstatement · cited by 53,352
- Set.Elemstatement · cited by 7,166
- Ordinalstatement · cited by 1,688
- Set.Iiostatement · cited by 1,166
- RelIsostatement · cited by 456
- RelEmbeddingstatement · cited by 281
- Ordinal.typestatement · cited by 207
- IsWellOrderstatement and proof · cited by 171
- PrincipalSeg.toRelEmbeddingstatement · cited by 129
- Ordinal.typeinstatement · cited by 60
- Ordinal.enumstatement · cited by 39
Cited by8
Results whose statement or proof uses this declaration.
- Ordinal.bsup'_eq_iSupproof · cited by 3
- Ordinal.type_lt_mem_range_succ_iffproof · cited by 3
- Ordinal.bfamilyOfFamily'_typeinproof · cited by 3
- Ordinal.enum_zero_leproof · cited by 1
- Ordinal.bounded_singletonproof · cited by 1
- Ordinal.has_succ_of_type_succ_ltproof · cited by 1
- Profinite.NobelingProof.term_ord_auxproof · cited by 1
- Ordinal.le_enum_succproof · cited by 0