Metamath Proof Explorer


Theorem suprub

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-Oct-2004)

Ref Expression
Assertion suprub ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x ∧ B ∈ A → B ≤ sup A ℝ <

Proof

Step Hyp Ref Expression
1 simp1 ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x → A ⊆ ℝ
2 1 sselda ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x ∧ B ∈ A → B ∈ ℝ
3 suprcl ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x → sup A ℝ < ∈ ℝ
4 3 adantr ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x ∧ B ∈ A → sup A ℝ < ∈ ℝ
5 ltso ⊢ < Or ℝ
6 5 a1i ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x → < Or ℝ
7 sup3 ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x → ∃ x ∈ ℝ ∀ y ∈ A ¬ x < y ∧ ∀ y ∈ ℝ y < x → ∃ z ∈ A y < z
8 6 7 supub ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x → B ∈ A → ¬ sup A ℝ < < B
9 8 imp ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x ∧ B ∈ A → ¬ sup A ℝ < < B
10 2 4 9 nltled ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x ∧ B ∈ A → B ≤ sup A ℝ <