Metamath Proof Explorer


Theorem suprubii

Description: A member of a nonempty bounded set of reals is less than or equal to the set's upper bound. (Contributed by NM, 12-Sep-1999)

Ref Expression
Hypothesis sup3i.1 ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x
Assertion suprubii ⊢ B ∈ A → B ≤ sup A ℝ <

Proof

Step Hyp Ref Expression
1 sup3i.1 ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x
2 suprub ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x ∧ B ∈ A → B ≤ sup A ℝ <
3 1 2 mpan ⊢ B ∈ A → B ≤ sup A ℝ <