Theorems · Theorem · order theory
bddBelow_union
∀ {α : Type u_1} [inst : Preorder α] [IsCodirectedOrder α] {s t : Set α}, BddBelow (s ∪ t) ↔ BddBelow s ∧ BddBelow tIn a codirected order, the union of two sets is bounded below if and only if both sets are.
- Defined in
- Mathlib.Order.Bounds.Basic
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 9 from the axioms · uses propext, Quot.sound
- Assumes
- PreorderIsCodirectedOrder
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
- Preorderstatement and proof · cited by 7,952
- BddBelowstatement and proof · cited by 401
- Set.subset_union_leftproof · cited by 142
- Set.subset_union_rightproof · cited by 123
- IsCodirectedOrderstatement and proof · cited by 95
- BddBelow.monoproof · cited by 16
- BddBelow.unionproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- Filter.IsBoundedUnder.bddBelow_range_of_cofiniteproof · cited by 2
- bddBelow_insertproof · cited by 1
- Set.Finite.bddBelow_biUnionproof · cited by 0