Theorems · Theorem · order theory
IsLUB.of_subset_of_superset
∀ {α : Type u_1} [inst : Preorder α] {a : α} {s t p : Set α}, IsLUB s a → IsLUB p a → s ⊆ t → t ⊆ p → IsLUB t aIf a is a least upper bound for sets s and p, then it is a least upper bound for any
set t, s ⊆ t ⊆ p.
- Defined in
- Mathlib.Order.Bounds.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 7 from the axioms · uses no axioms
- Assumes
- Preorder
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
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
- IsLUBstatement and proof · cited by 280
- upperBounds_mono_setproof · cited by 13
- lowerBounds_mono_setproof · cited by 12
Cited by1
Results whose statement or proof uses this declaration.
- isLUB_Icoproof · cited by 3