Metamath Proof Explorer


Theorem suprlubrd

Description: Natural deduction form of specialized suprlub . (Contributed by Stanislas Polu, 9-Mar-2020)

Ref Expression
Hypotheses suprlubrd.1 ⊢ φ → A ⊆ ℝ
suprlubrd.2 ⊢ φ → A ≠ ∅
suprlubrd.3 ⊢ φ → ∃ x ∈ ℝ ∀ y ∈ A y ≤ x
suprlubrd.4 ⊢ φ → B ∈ ℝ
suprlubrd.5 ⊢ φ → ∃ z ∈ A B < z
Assertion suprlubrd ⊢ φ → B < sup A ℝ <

Proof

Step Hyp Ref Expression
1 suprlubrd.1 ⊢ φ → A ⊆ ℝ
2 suprlubrd.2 ⊢ φ → A ≠ ∅
3 suprlubrd.3 ⊢ φ → ∃ x ∈ ℝ ∀ y ∈ A y ≤ x
4 suprlubrd.4 ⊢ φ → B ∈ ℝ
5 suprlubrd.5 ⊢ φ → ∃ z ∈ A B < z
6 suprlub ⊢ A ⊆ ℝ ∧ A ≠ ∅ ∧ ∃ x ∈ ℝ ∀ y ∈ A y ≤ x ∧ B ∈ ℝ → B < sup A ℝ < ↔ ∃ z ∈ A B < z
7 1 2 3 4 6 syl31anc ⊢ φ → B < sup A ℝ < ↔ ∃ z ∈ A B < z
8 7 bicomd ⊢ φ → ∃ z ∈ A B < z ↔ B < sup A ℝ <
9 8 biimpd ⊢ φ → ∃ z ∈ A B < z → B < sup A ℝ <
10 9 imp ⊢ φ ∧ ∃ z ∈ A B < z → B < sup A ℝ <
11 5 10 mpdan ⊢ φ → B < sup A ℝ <