Theorems · Theorem · order theory
iSup_mono
∀ {α : Type u_1} {ι : Sort u_4} [inst : CompleteLattice α] {f g : ι → α}, (∀ (i : ι), f i ≤ g i) → iSup f ≤ iSup g- Defined in
- Mathlib.Order.CompleteLattice.Basic
- Cited by
- 37 results in Mathlib
- Foundations
- Depth 12 from the axioms · 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.
- iSupstatement · cited by 2,415
- CompleteLatticestatement and proof · cited by 1,048
- iSup_leproof · cited by 190
- le_iSup_of_leproof · cited by 79
Cited by37
Results whose statement or proof uses this declaration.
- Set.iUnion_monoproof · cited by 21
- iSup₂_monoproof · cited by 18
- iSup_commproof · cited by 17
- MeasureTheory.lintegral_iSupproof · cited by 16
- biSup_monoproof · cited by 15
- MeasureTheory.lintegral_mono'proof · cited by 12
- Set.iUnion_mono''proof · cited by 9
- iSup_sup_eqproof · cited by 7
- iSupIndep.compproof · cited by 6
- ProbabilityTheory.Kernel.indep_iSup_directed_limsupproof · cited by 3
- Monotone.iSup_nat_addproof · cited by 3
- iSup_symmDiff_iSup_leproof · cited by 3