Theorems · Theorem · logic and foundations
Ordinal.iSup_le
∀ {ι : Sort u_3} {f : ι → Ordinal.{u_4}} {a : Ordinal.{u_4}}, (∀ (i : ι), f i ≤ a) → ⨆ i, f i ≤ aAn alias of ciSup_le' for discoverability.
- Defined in
- Mathlib.SetTheory.Ordinal.Family
- Cited by
- 18 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.
Cites3
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by18
Results whose statement or proof uses this declaration.
- Ordinal.iSup_iterate_eq_nfpproof · cited by 5
- Ordinal.nfpFamily_fpproof · cited by 4
- Ordinal.iSup_le_lsubproof · cited by 4
- Ordinal.iSup_natCastproof · cited by 4
- PSet.rank_le_iffproof · cited by 3
- Ordinal.nfpFamily_leproof · cited by 2
- Ordinal.nfpFamily_le_fpproof · cited by 2
- Ordinal.succ_lt_iSup_of_ne_iSupproof · cited by 2
- Ordinal.nfpFamily_eq_selfproof · cited by 1
- Ordinal.nfp_zero_leftproof · cited by 1
- Ordinal.iSup_sumproof · cited by 1
- Ordinal.isNormal_enumOrdproof · cited by 0