Metamath Proof Explorer


Theorem supxrub

Description: A member of a set of extended reals is less than or equal to the set's supremum. (Contributed by NM, 7-Feb-2006)

Ref Expression
Assertion supxrub ⊢ A ⊆ ℝ * ∧ B ∈ A → B ≤ sup A ℝ * <

Proof

Step Hyp Ref Expression
1 ssel2 ⊢ A ⊆ ℝ * ∧ B ∈ A → B ∈ ℝ *
2 supxrcl ⊢ A ⊆ ℝ * → sup A ℝ * < ∈ ℝ *
3 2 adantr ⊢ A ⊆ ℝ * ∧ B ∈ A → sup A ℝ * < ∈ ℝ *
4 xrltso ⊢ < Or ℝ *
5 4 a1i ⊢ A ⊆ ℝ * → < Or ℝ *
6 xrsupss ⊢ A ⊆ ℝ * → ∃ x ∈ ℝ * ∀ y ∈ A ¬ x < y ∧ ∀ y ∈ ℝ * y < x → ∃ z ∈ A y < z
7 5 6 supub ⊢ A ⊆ ℝ * → B ∈ A → ¬ sup A ℝ * < < B
8 7 imp ⊢ A ⊆ ℝ * ∧ B ∈ A → ¬ sup A ℝ * < < B
9 1 3 8 xrnltled ⊢ A ⊆ ℝ * ∧ B ∈ A → B ≤ sup A ℝ * <