Theorems · Theorem · order theory
le_csInf_iff
∀ {α : Type u_1} [inst : ConditionallyCompleteLattice α] {s : Set α} {a : α},
BddBelow s → s.Nonempty → (a ≤ sInf s ↔ ∀ b ∈ s, a ≤ b)- Cited by
- 3 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses propext, Quot.sound
- Assumes
- ConditionallyCompleteLattice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites7
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.Nonemptystatement and proof · cited by 2,627
- InfSet.sInfstatement · cited by 935
- BddBelowstatement and proof · cited by 401
- ConditionallyCompleteLatticestatement and proof · cited by 364
- isGLB_csInfproof · cited by 24
- le_isGLB_iffproof · cited by 17
Cited by3
Results whose statement or proof uses this declaration.
- ContinuousLinearMap.opNorm_eq_of_boundsproof · cited by 5
- le_csInf_iff''proof · cited by 1
- NormedAddGroupHom.opNorm_eq_of_boundsproof · cited by 1