Theorems · Theorem · order theory
csInf_upperBounds_range
∀ {α : Type u_1} {β : Type u_2} [inst : ConditionallyCompleteLattice α] [Nonempty β] {f : β → α},
BddAbove (Set.range f) → sInf (upperBounds (Set.range f)) = ⨆ i, f i- Cited by
- 1 results in Mathlib
- Foundations
- Depth 11 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Set.rangestatement and proof · cited by 4,705
- iSupstatement · cited by 2,415
- InfSet.sInfstatement · cited by 935
- BddAbovestatement and proof · cited by 620
- ConditionallyCompleteLatticestatement and proof · cited by 364
- upperBoundsstatement · cited by 263
- Set.range_nonemptyproof · cited by 84
- csInf_upperBounds_eq_csSupproof · cited by 2
Cited by1
Results whose statement or proof uses this declaration.
- Monotone.ciSup_comp_tendsto_atTopproof · cited by 4