Metamath Proof Explorer


Theorem supxrlub

Description: The supremum of a set of extended reals is less than or equal to an upper bound. (Contributed by Mario Carneiro, 13-Sep-2015)

Ref Expression
Assertion supxrlub ⊢ A ⊆ ℝ * ∧ B ∈ ℝ * → B < sup A ℝ * < ↔ ∃ x ∈ A B < x

Proof

Step Hyp Ref Expression
1 xrltso ⊢ < Or ℝ *
2 1 a1i ⊢ A ⊆ ℝ * → < Or ℝ *
3 xrsupss ⊢ A ⊆ ℝ * → ∃ y ∈ ℝ * ∀ z ∈ A ¬ y < z ∧ ∀ z ∈ ℝ * z < y → ∃ x ∈ A z < x
4 id ⊢ A ⊆ ℝ * → A ⊆ ℝ *
5 2 3 4 suplub2 ⊢ A ⊆ ℝ * ∧ B ∈ ℝ * → B < sup A ℝ * < ↔ ∃ x ∈ A B < x