Metamath Proof Explorer


Theorem suprltrp

Description: The supremum of a nonempty bounded set of reals can be approximated from below by elements of the set. (Contributed by Glauco Siliprandi, 17-Aug-2020)

Ref Expression
Hypotheses suprltrp.a ⊢ φ → A ⊆ ℝ
suprltrp.n0 ⊢ φ → A ≠ ∅
suprltrp.bnd ⊢ φ → ∃ x ∈ ℝ ∀ y ∈ A y ≤ x
suprltrp.x ⊢ φ → X ∈ ℝ +
Assertion suprltrp ⊢ φ → ∃ z ∈ A sup A ℝ < − X < z

Proof

Step Hyp Ref Expression
1 suprltrp.a ⊢ φ → A ⊆ ℝ
2 suprltrp.n0 ⊢ φ → A ≠ ∅
3 suprltrp.bnd ⊢ φ → ∃ x ∈ ℝ ∀ y ∈ A y ≤ x
4 suprltrp.x ⊢ φ → X ∈ ℝ +
5 suprcl ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x → sup A ℝ < ∈ ℝ
6 1 2 3 5 syl3anc ⊢ φ → sup A ℝ < ∈ ℝ
7 6 4 ltsubrpd ⊢ φ → sup A ℝ < − X < sup A ℝ <
8 4 rpred ⊢ φ → X ∈ ℝ
9 6 8 resubcld ⊢ φ → sup A ℝ < − X ∈ ℝ
10 suprlub ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x ∧ sup A ℝ < − X ∈ ℝ → sup A ℝ < − X < sup A ℝ < ↔ ∃ z ∈ A sup A ℝ < − X < z
11 1 2 3 9 10 syl31anc ⊢ φ → sup A ℝ < − X < sup A ℝ < ↔ ∃ z ∈ A sup A ℝ < − X < z
12 7 11 mpbid ⊢ φ → ∃ z ∈ A sup A ℝ < − X < z