Theorems · Theorem · order theory
BddBelow.union
∀ {α : Type u_1} [inst : Preorder α] [IsCodirectedOrder α] {s t : Set α}, BddBelow s → BddBelow t → BddBelow (s ∪ t)In a codirected order, the union of bounded below sets is bounded below.
- Defined in
- Mathlib.Order.Bounds.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses propext, Quot.sound
- Assumes
- PreorderIsCodirectedOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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
- Preorderstatement and proof · cited by 7,952
- Set.Nonemptyproof · cited by 2,627
- BddBelowstatement and proof · cited by 401
- lowerBoundsproof · cited by 212
- IsCodirectedOrderstatement and proof · cited by 95
- exists_le_leproof · cited by 9
- lowerBounds_mono_memproof · cited by 3
- lowerBounds_unionproof · cited by 3
Cited by1
Results whose statement or proof uses this declaration.
- bddBelow_unionproof · cited by 3