Theorems · Theorem · logic and foundations
Ordinal.isNormal_enumOrd
∀ {s : Set Ordinal.{u}},
(∀ t ⊆ s, t.Nonempty → BddAbove t → sSup t ∈ s) → ¬BddAbove s → Order.IsNormal (Ordinal.enumOrd s)If s is closed under nonempty suprema, then its enumerator function is normal.
See also enumOrd_isNormal_iff_isClosed.
- Defined in
- Mathlib.SetTheory.Ordinal.Enum
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 85 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites24
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.Elemproof · cited by 7,166
- Set.rangeproof · cited by 4,705
- Set.Nonemptystatement and proof · cited by 2,627
- Ordinalstatement and proof · cited by 1,688
- Set.Iioproof · cited by 1,166
- SupSet.sSupstatement and proof · cited by 954
- LT.lt.trans_leproof · cited by 678
- Order.succproof · cited by 633
- BddAbovestatement and proof · cited by 620
- Order.IsSuccLimitproof · cited by 255
- Order.IsNormalstatement · cited by 118
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.