Theorems · Theorem · order theory
csInf_eq_univ_of_not_bddBelow
∀ {α : Type u_1} [inst : ConditionallyCompleteLinearOrder α] {s : Set α}, ¬BddBelow s → sInf s = sInf Set.univ- Cited by
- 1 results in Mathlib
- Foundations
- Depth 10 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.
- Setstatement and proof · cited by 53,352
- Set.univstatement and proof · cited by 3,945
- InfSet.sInfstatement and proof · cited by 935
- ConditionallyCompleteLinearOrderstatement and proof · cited by 542
- BddBelowstatement and proof · cited by 401
- Set.subset_univproof · cited by 228
- BddBelow.monoproof · cited by 16
- csInf_of_not_bddBelowproof · cited by 8
Cited by1
Results whose statement or proof uses this declaration.
- ciInf_eq_univ_of_not_bddBelowproof · cited by 0