Theorems · Theorem · order theory
iSup_le
∀ {α : Type u_1} {ι : Sort u_4} [inst : CompleteLattice α] {f : ι → α} {a : α}, (∀ (i : ι), f i ≤ a) → iSup f ≤ a- Defined in
- Mathlib.Order.CompleteLattice.Basic
- Cited by
- 190 results in Mathlib
- Foundations
- Depth 10 from the axioms, rests on 45 definitions · uses no axioms
- Assumes
- CompleteLattice
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.
- Set.rangeproof · cited by 4,705
- iSupstatement · cited by 2,415
- CompleteLatticestatement and proof · cited by 1,048
- sSup_leproof · cited by 35
Cited by190
Results whose statement or proof uses this declaration.
- iSup₂_leproof · cited by 96
- iSup_posproof · cited by 61
- Set.iUnion_subsetproof · cited by 51
- iSup_negproof · cited by 49
- iSup_monoproof · cited by 37
- Finset.sup_eq_iSupproof · cited by 30
- iSup_subtypeproof · cited by 26
- iSup_commproof · cited by 17
- iSup_mono'proof · cited by 17
- MeasureTheory.lintegral_iSupproof · cited by 16
- iSup_andproof · cited by 13
- iSup_existsproof · cited by 13