Metamath Proof Explorer


Theorem upbdrech2

Description: Choice of an upper bound for a possibly empty bunded set (image set version). (Contributed by Glauco Siliprandi, 11-Dec-2019)

Ref Expression
Hypotheses upbdrech2.b ⊢ φ ∧ x ∈ A → B ∈ ℝ
upbdrech2.bd ⊢ φ → ∃ y ∈ ℝ ∀ x ∈ A B ≤ y
upbdrech2.c ⊢ C = if A = ∅ 0 sup z | ∃ x ∈ A z = B ℝ <
Assertion upbdrech2 ⊢ φ → C ∈ ℝ ∧ ∀ x ∈ A B ≤ C

Proof

Step Hyp Ref Expression
1 upbdrech2.b ⊢ φ ∧ x ∈ A → B ∈ ℝ
2 upbdrech2.bd ⊢ φ → ∃ y ∈ ℝ ∀ x ∈ A B ≤ y
3 upbdrech2.c ⊢ C = if A = ∅ 0 sup z | ∃ x ∈ A z = B ℝ <
4 iftrue ⊢ A = ∅ → if A = ∅ 0 sup z | ∃ x ∈ A z = B ℝ < = 0
5 0red ⊢ A = ∅ → 0 ∈ ℝ
6 4 5 eqeltrd ⊢ A = ∅ → if A = ∅ 0 sup z | ∃ x ∈ A z = B ℝ < ∈ ℝ
7 6 adantl ⊢ φ ∧ A = ∅ → if A = ∅ 0 sup z | ∃ x ∈ A z = B ℝ < ∈ ℝ
8 simpr ⊢ φ ∧ ¬ A = ∅ → ¬ A = ∅
9 8 iffalsed ⊢ φ ∧ ¬ A = ∅ → if A = ∅ 0 sup z | ∃ x ∈ A z = B ℝ < = sup z | ∃ x ∈ A z = B ℝ <
10 8 neqned ⊢ φ ∧ ¬ A = ∅ → A ≠ ∅
11 1 adantlr ⊢ φ ∧ ¬ A = ∅ ∧ x ∈ A → B ∈ ℝ
12 2 adantr ⊢ φ ∧ ¬ A = ∅ → ∃ y ∈ ℝ ∀ x ∈ A B ≤ y
13 eqid ⊢ sup z | ∃ x ∈ A z = B ℝ < = sup z | ∃ x ∈ A z = B ℝ <
14 10 11 12 13 upbdrech ⊢ φ ∧ ¬ A = ∅ → sup z | ∃ x ∈ A z = B ℝ < ∈ ℝ ∧ ∀ x ∈ A B ≤ sup z | ∃ x ∈ A z = B ℝ <
15 14 simpld ⊢ φ ∧ ¬ A = ∅ → sup z | ∃ x ∈ A z = B ℝ < ∈ ℝ
16 9 15 eqeltrd ⊢ φ ∧ ¬ A = ∅ → if A = ∅ 0 sup z | ∃ x ∈ A z = B ℝ < ∈ ℝ
17 7 16 pm2.61dan ⊢ φ → if A = ∅ 0 sup z | ∃ x ∈ A z = B ℝ < ∈ ℝ
18 3 17 eqeltrid ⊢ φ → C ∈ ℝ
19 rzal ⊢ A = ∅ → ∀ x ∈ A B ≤ C
20 19 adantl ⊢ φ ∧ A = ∅ → ∀ x ∈ A B ≤ C
21 14 simprd ⊢ φ ∧ ¬ A = ∅ → ∀ x ∈ A B ≤ sup z | ∃ x ∈ A z = B ℝ <
22 iffalse ⊢ ¬ A = ∅ → if A = ∅ 0 sup z | ∃ x ∈ A z = B ℝ < = sup z | ∃ x ∈ A z = B ℝ <
23 3 22 eqtrid ⊢ ¬ A = ∅ → C = sup z | ∃ x ∈ A z = B ℝ <
24 23 breq2d ⊢ ¬ A = ∅ → B ≤ C ↔ B ≤ sup z | ∃ x ∈ A z = B ℝ <
25 24 ralbidv ⊢ ¬ A = ∅ → ∀ x ∈ A B ≤ C ↔ ∀ x ∈ A B ≤ sup z | ∃ x ∈ A z = B ℝ <
26 25 adantl ⊢ φ ∧ ¬ A = ∅ → ∀ x ∈ A B ≤ C ↔ ∀ x ∈ A B ≤ sup z | ∃ x ∈ A z = B ℝ <
27 21 26 mpbird ⊢ φ ∧ ¬ A = ∅ → ∀ x ∈ A B ≤ C
28 20 27 pm2.61dan ⊢ φ → ∀ x ∈ A B ≤ C
29 18 28 jca ⊢ φ → C ∈ ℝ ∧ ∀ x ∈ A B ≤ C