Theorems · Definition · logic and foundations
Ordinal.enumOrd
Set Ordinal.{u} → Ordinal.{u} → Ordinal.{u}Enumerator function for an unbounded set of ordinals.
The definition is an implementation detail; this function is entirely characterized by being an
order isomorphism. See enumOrdOrderIso.
- Defined in
- Mathlib.SetTheory.Ordinal.Enum
- Cited by
- 23 results in Mathlib
- Foundations
- Depth 40 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.ofPredproof · cited by 6,101
- Ordinalstatement and proof · cited by 1,688
- InfSet.sInfproof · cited by 935
Cited by25
Results whose statement or proof uses this declaration.
- Ordinal.preOmegaproof · cited by 31
- Ordinal.enumOrd_strictMonostatement · cited by 10
- Ordinal.enumOrd_le_of_forall_ltstatement and proof · cited by 5
- Ordinal.range_enumOrdstatement and proof · cited by 4
- Ordinal.enumOrd_memstatement · cited by 4
- Ordinal.veblenWith_add_oneproof · cited by 3
- Ordinal.derivFamily_eq_enumOrdstatement · cited by 2
- Ordinal.eq_enumOrdstatement and proof · cited by 2
- Ordinal.enumOrdOrderIsoproof · cited by 1
- Ordinal.enumOrd_injectivestatement · cited by 1
- Ordinal.enumOrd_rangestatement · cited by 1
- Ordinal.enumOrd_succ_lestatement and proof · cited by 1