Metamath Proof Explorer


Theorem supxrun

Description: The supremum of the union of two sets of extended reals equals the largest of their suprema. (Contributed by NM, 19-Jan-2006)

Ref Expression
Assertion supxrun ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ sup A ℝ * < ≤ sup B ℝ * < → sup A ∪ B ℝ * < = sup B ℝ * <

Proof

Step Hyp Ref Expression
1 unss ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ↔ A ∪ B ⊆ ℝ *
2 1 biimpi ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * → A ∪ B ⊆ ℝ *
3 2 3adant3 ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ sup A ℝ * < ≤ sup B ℝ * < → A ∪ B ⊆ ℝ *
4 supxrcl ⊢ B ⊆ ℝ * → sup B ℝ * < ∈ ℝ *
5 4 3ad2ant2 ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ sup A ℝ * < ≤ sup B ℝ * < → sup B ℝ * < ∈ ℝ *
6 elun ⊢ x ∈ A ∪ B ↔ x ∈ A ∨ x ∈ B
7 xrltso ⊢ < Or ℝ *
8 7 a1i ⊢ A ⊆ ℝ * → < Or ℝ *
9 xrsupss ⊢ A ⊆ ℝ * → ∃ y ∈ ℝ * ∀ z ∈ A ¬ y < z ∧ ∀ z ∈ ℝ * z < y → ∃ w ∈ A z < w
10 8 9 supub ⊢ A ⊆ ℝ * → x ∈ A → ¬ sup A ℝ * < < x
11 10 3ad2ant1 ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ sup A ℝ * < ≤ sup B ℝ * < → x ∈ A → ¬ sup A ℝ * < < x
12 supxrcl ⊢ A ⊆ ℝ * → sup A ℝ * < ∈ ℝ *
13 12 ad2antrr ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ x ∈ A → sup A ℝ * < ∈ ℝ *
14 4 ad2antlr ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ x ∈ A → sup B ℝ * < ∈ ℝ *
15 ssel2 ⊢ A ⊆ ℝ * ∧ x ∈ A → x ∈ ℝ *
16 15 adantlr ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ x ∈ A → x ∈ ℝ *
17 xrlelttr ⊢ sup A ℝ * < ∈ ℝ * ∧ sup B ℝ * < ∈ ℝ * ∧ x ∈ ℝ * → sup A ℝ * < ≤ sup B ℝ * < ∧ sup B ℝ * < < x → sup A ℝ * < < x
18 13 14 16 17 syl3anc ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ x ∈ A → sup A ℝ * < ≤ sup B ℝ * < ∧ sup B ℝ * < < x → sup A ℝ * < < x
19 18 expdimp ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ x ∈ A ∧ sup A ℝ * < ≤ sup B ℝ * < → sup B ℝ * < < x → sup A ℝ * < < x
20 19 con3d ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ x ∈ A ∧ sup A ℝ * < ≤ sup B ℝ * < → ¬ sup A ℝ * < < x → ¬ sup B ℝ * < < x
21 20 exp41 ⊢ A ⊆ ℝ * → B ⊆ ℝ * → x ∈ A → sup A ℝ * < ≤ sup B ℝ * < → ¬ sup A ℝ * < < x → ¬ sup B ℝ * < < x
22 21 com34 ⊢ A ⊆ ℝ * → B ⊆ ℝ * → sup A ℝ * < ≤ sup B ℝ * < → x ∈ A → ¬ sup A ℝ * < < x → ¬ sup B ℝ * < < x
23 22 3imp ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ sup A ℝ * < ≤ sup B ℝ * < → x ∈ A → ¬ sup A ℝ * < < x → ¬ sup B ℝ * < < x
24 11 23 mpdd ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ sup A ℝ * < ≤ sup B ℝ * < → x ∈ A → ¬ sup B ℝ * < < x
25 7 a1i ⊢ B ⊆ ℝ * → < Or ℝ *
26 xrsupss ⊢ B ⊆ ℝ * → ∃ y ∈ ℝ * ∀ z ∈ B ¬ y < z ∧ ∀ z ∈ ℝ * z < y → ∃ w ∈ B z < w
27 25 26 supub ⊢ B ⊆ ℝ * → x ∈ B → ¬ sup B ℝ * < < x
28 27 3ad2ant2 ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ sup A ℝ * < ≤ sup B ℝ * < → x ∈ B → ¬ sup B ℝ * < < x
29 24 28 jaod ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ sup A ℝ * < ≤ sup B ℝ * < → x ∈ A ∨ x ∈ B → ¬ sup B ℝ * < < x
30 6 29 biimtrid ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ sup A ℝ * < ≤ sup B ℝ * < → x ∈ A ∪ B → ¬ sup B ℝ * < < x
31 30 ralrimiv ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ sup A ℝ * < ≤ sup B ℝ * < → ∀ x ∈ A ∪ B ¬ sup B ℝ * < < x
32 rexr ⊢ x ∈ ℝ → x ∈ ℝ *
33 xrsupss ⊢ B ⊆ ℝ * → ∃ x ∈ ℝ * ∀ z ∈ B ¬ x < z ∧ ∀ z ∈ ℝ * z < x → ∃ y ∈ B z < y
34 25 33 suplub ⊢ B ⊆ ℝ * → x ∈ ℝ * ∧ x < sup B ℝ * < → ∃ y ∈ B x < y
35 32 34 sylani ⊢ B ⊆ ℝ * → x ∈ ℝ ∧ x < sup B ℝ * < → ∃ y ∈ B x < y
36 elun2 ⊢ y ∈ B → y ∈ A ∪ B
37 36 anim1i ⊢ y ∈ B ∧ x < y → y ∈ A ∪ B ∧ x < y
38 37 reximi2 ⊢ ∃ y ∈ B x < y → ∃ y ∈ A ∪ B x < y
39 35 38 syl6 ⊢ B ⊆ ℝ * → x ∈ ℝ ∧ x < sup B ℝ * < → ∃ y ∈ A ∪ B x < y
40 39 expd ⊢ B ⊆ ℝ * → x ∈ ℝ → x < sup B ℝ * < → ∃ y ∈ A ∪ B x < y
41 40 ralrimiv ⊢ B ⊆ ℝ * → ∀ x ∈ ℝ x < sup B ℝ * < → ∃ y ∈ A ∪ B x < y
42 41 3ad2ant2 ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ sup A ℝ * < ≤ sup B ℝ * < → ∀ x ∈ ℝ x < sup B ℝ * < → ∃ y ∈ A ∪ B x < y
43 supxr ⊢ A ∪ B ⊆ ℝ * ∧ sup B ℝ * < ∈ ℝ * ∧ ∀ x ∈ A ∪ B ¬ sup B ℝ * < < x ∧ ∀ x ∈ ℝ x < sup B ℝ * < → ∃ y ∈ A ∪ B x < y → sup A ∪ B ℝ * < = sup B ℝ * <
44 3 5 31 42 43 syl22anc ⊢ A ⊆ ℝ * ∧ B ⊆ ℝ * ∧ sup A ℝ * < ≤ sup B ℝ * < → sup A ∪ B ℝ * < = sup B ℝ * <