| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xaddnepnf | Structured version Visualization version GIF version | ||
| Description: Closure of extended real addition in the subset ℝ* / {+∞}. (Contributed by Mario Carneiro, 20-Aug-2015.) |
| Ref | Expression |
|---|---|
| xaddnepnf | ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xrnepnf 13110 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ↔ (𝐴 ∈ ℝ ∨ 𝐴 = -∞)) | |
| 2 | xrnepnf 13110 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞) ↔ (𝐵 ∈ ℝ ∨ 𝐵 = -∞)) | |
| 3 | rexadd 13225 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) | |
| 4 | readdcl 11146 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 5 | 3, 4 | eqeltrd 2856 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ∈ ℝ) |
| 6 | 5 | renepnfd 11223 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 7 | oveq2 7393 | . . . . . . 7 ⊢ (𝐵 = -∞ → (𝐴 +𝑒 𝐵) = (𝐴 +𝑒 -∞)) | |
| 8 | rexr 11218 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 9 | renepnf 11220 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) | |
| 10 | xaddmnf1 13221 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) → (𝐴 +𝑒 -∞) = -∞) | |
| 11 | 8, 9, 10 | syl2anc 592 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝐴 +𝑒 -∞) = -∞) |
| 12 | 7, 11 | sylan9eqr 2813 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 +𝑒 𝐵) = -∞) |
| 13 | mnfnepnf 11228 | . . . . . . 7 ⊢ -∞ ≠ +∞ | |
| 14 | 13 | a1i 11 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → -∞ ≠ +∞) |
| 15 | 12, 14 | eqnetrd 3018 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 16 | 6, 15 | jaodan 968 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = -∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 17 | 2, 16 | sylan2b 602 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 18 | oveq1 7392 | . . . . 5 ⊢ (𝐴 = -∞ → (𝐴 +𝑒 𝐵) = (-∞ +𝑒 𝐵)) | |
| 19 | xaddmnf2 13222 | . . . . 5 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞) → (-∞ +𝑒 𝐵) = -∞) | |
| 20 | 18, 19 | sylan9eq 2811 | . . . 4 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) = -∞) |
| 21 | 13 | a1i 11 | . . . 4 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → -∞ ≠ +∞) |
| 22 | 20, 21 | eqnetrd 3018 | . . 3 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 23 | 17, 22 | jaoian 967 | . 2 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = -∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 24 | 1, 23 | sylanb 589 | 1 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 398 ∨ wo 856 = wceq 1554 ∈ wcel 2136 ≠ wne 2951 (class class class)co 7385 ℝcr 11062 + caddc 11066 +∞cpnf 11203 -∞cmnf 11204 ℝ*cxr 11205 +𝑒 cxad 13102 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-10 2169 ax-11 2185 ax-12 2206 ax-ext 2728 ax-sep 5240 ax-nul 5250 ax-pow 5316 ax-pr 5384 ax-un 7707 ax-cnex 11119 ax-resscn 11120 ax-1cn 11121 ax-icn 11122 ax-addcl 11123 ax-addrcl 11124 ax-mulcl 11125 ax-i2m1 11131 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-nf 1798 df-sb 2085 df-mo 2560 df-eu 2590 df-clab 2735 df-cleq 2748 df-clel 2831 df-nfc 2905 df-ne 2952 df-nel 3056 df-ral 3071 df-rex 3081 df-rab 3409 df-v 3450 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4281 df-if 4475 df-pw 4551 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-br 5095 df-opab 5157 df-mpt 5176 df-id 5535 df-xp 5646 df-rel 5647 df-cnv 5648 df-co 5649 df-dm 5650 df-rn 5651 df-res 5652 df-ima 5653 df-iota 6466 df-fun 6512 df-fn 6513 df-f 6514 df-f1 6515 df-fo 6516 df-f1o 6517 df-fv 6518 df-ov 7388 df-oprab 7389 df-mpo 7390 df-er 8666 df-en 8917 df-dom 8918 df-sdom 8919 df-pnf 11208 df-mnf 11209 df-xr 11210 df-xadd 13105 |
| This theorem is referenced by: xlt2add 13253 |
| Copyright terms: Public domain | W3C validator |