| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xaddnemnf | Structured version Visualization version GIF version | ||
| Description: Closure of extended real addition in the subset ℝ* / {-∞}. (Contributed by Mario Carneiro, 20-Aug-2015.) |
| Ref | Expression |
|---|---|
| xaddnemnf | ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +e 𝐵) ≠ -∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xrnemnf 13259 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞)) | |
| 2 | xrnemnf 13259 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞) ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞)) | |
| 3 | rexadd 13375 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +e 𝐵) = (𝐴 + 𝐵)) | |
| 4 | readdcl 11296 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 5 | 3, 4 | eqeltrd 2864 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +e 𝐵) ∈ ℝ) |
| 6 | 5 | renemnfd 11374 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +e 𝐵) ≠ -∞) |
| 7 | oveq2 7438 | . . . . . . 7 ⊢ (𝐵 = +∞ → (𝐴 +e 𝐵) = (𝐴 +e +∞)) | |
| 8 | rexr 11368 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 9 | renemnf 11371 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ -∞) | |
| 10 | xaddpnf1 13369 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +e +∞) = +∞) | |
| 11 | 8, 9, 10 | syl2anc 596 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝐴 +e +∞) = +∞) |
| 12 | 7, 11 | sylan9eqr 2820 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 +e 𝐵) = +∞) |
| 13 | pnfnemnf 11377 | . . . . . . 7 ⊢ +∞ ≠ -∞ | |
| 14 | 13 | a1i 11 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → +∞ ≠ -∞) |
| 15 | 12, 14 | eqnetrd 3026 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 +e 𝐵) ≠ -∞) |
| 16 | 6, 15 | jaodan 972 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞)) → (𝐴 +e 𝐵) ≠ -∞) |
| 17 | 2, 16 | sylan2b 606 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +e 𝐵) ≠ -∞) |
| 18 | oveq1 7437 | . . . . 5 ⊢ (𝐴 = +∞ → (𝐴 +e 𝐵) = (+∞ +e 𝐵)) | |
| 19 | xaddpnf2 13370 | . . . . 5 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞) → (+∞ +e 𝐵) = +∞) | |
| 20 | 18, 19 | sylan9eq 2818 | . . . 4 ⊢ ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +e 𝐵) = +∞) |
| 21 | 13 | a1i 11 | . . . 4 ⊢ ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → +∞ ≠ -∞) |
| 22 | 20, 21 | eqnetrd 3026 | . . 3 ⊢ ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +e 𝐵) ≠ -∞) |
| 23 | 17, 22 | jaoian 971 | . 2 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +e 𝐵) ≠ -∞) |
| 24 | 1, 23 | sylanb 593 | 1 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +e 𝐵) ≠ -∞) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1569 ∈ wcel 2146 ≠ wne 2959 (class class class)co 7430 ℝcr 11212 + caddc 11216 +∞cpnf 11353 -∞cmnf 11354 ℝ*cxr 11355 +e cxad 13252 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7761 ax-cnex 11269 ax-resscn 11270 ax-1cn 11271 ax-icn 11272 ax-addcl 11273 ax-addrcl 11274 ax-mulcl 11275 ax-i2m1 11281 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6501 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-ov 7433 df-oprab 7434 df-mpo 7435 df-er 8731 df-en 8988 df-dom 8989 df-sdom 8990 df-pnf 11358 df-mnf 11359 df-xr 11360 df-xadd 13255 |
| This theorem is used by: xaddass 13392 xlt2add 13403 xadd4d 13446 xrs1mnd 21761 |
| Copyright terms: Public domain | W3C validator |