Theorems · Theorem · order theory
bddBelow_insert
∀ {α : Type u_1} [inst : Preorder α] [IsCodirectedOrder α] {s : Set α} {a : α}, BddBelow (insert a s) ↔ BddBelow sAdding a point to a set preserves its boundedness below.
- Defined in
- Mathlib.Order.Bounds.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 10 from the axioms · uses propext, Quot.sound
- Assumes
- PreorderIsCodirectedOrder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
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
- IsCodirectedOrderstatement and proof · cited by 95
- bddBelow_unionproof · cited by 3
- bddBelow_singletonproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- BddBelow.insertproof · cited by 1