| 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 13134 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ↔ (𝐴 ∈ ℝ ∨ 𝐴 = -∞)) | |
| 2 | xrnepnf 13134 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞) ↔ (𝐵 ∈ ℝ ∨ 𝐵 = -∞)) | |
| 3 | rexadd 13249 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) | |
| 4 | readdcl 11171 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 5 | 3, 4 | eqeltrd 2865 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ∈ ℝ) |
| 6 | 5 | renepnfd 11248 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 7 | oveq2 7408 | . . . . . . 7 ⊢ (𝐵 = -∞ → (𝐴 +𝑒 𝐵) = (𝐴 +𝑒 -∞)) | |
| 8 | rexr 11243 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 9 | renepnf 11245 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) | |
| 10 | xaddmnf1 13245 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) → (𝐴 +𝑒 -∞) = -∞) | |
| 11 | 8, 9, 10 | syl2anc 595 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝐴 +𝑒 -∞) = -∞) |
| 12 | 7, 11 | sylan9eqr 2822 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 +𝑒 𝐵) = -∞) |
| 13 | mnfnepnf 11253 | . . . . . . 7 ⊢ -∞ ≠ +∞ | |
| 14 | 13 | a1i 11 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → -∞ ≠ +∞) |
| 15 | 12, 14 | eqnetrd 3027 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = -∞) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 16 | 6, 15 | jaodan 972 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = -∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 17 | 2, 16 | sylan2b 605 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 18 | oveq1 7407 | . . . . 5 ⊢ (𝐴 = -∞ → (𝐴 +𝑒 𝐵) = (-∞ +𝑒 𝐵)) | |
| 19 | xaddmnf2 13246 | . . . . 5 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞) → (-∞ +𝑒 𝐵) = -∞) | |
| 20 | 18, 19 | sylan9eq 2820 | . . . 4 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) = -∞) |
| 21 | 13 | a1i 11 | . . . 4 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → -∞ ≠ +∞) |
| 22 | 20, 21 | eqnetrd 3027 | . . 3 ⊢ ((𝐴 = -∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 23 | 17, 22 | jaoian 971 | . 2 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = -∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| 24 | 1, 23 | sylanb 592 | 1 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ +∞)) → (𝐴 +𝑒 𝐵) ≠ +∞) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∨ wo 860 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 (class class class)co 7400 ℝcr 11087 + caddc 11091 +∞cpnf 11228 -∞cmnf 11229 ℝ*cxr 11230 +𝑒 cxad 13126 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2737 ax-sep 5251 ax-nul 5261 ax-pow 5327 ax-pr 5395 ax-un 7722 ax-cnex 11144 ax-resscn 11145 ax-1cn 11146 ax-icn 11147 ax-addcl 11148 ax-addrcl 11149 ax-mulcl 11150 ax-i2m1 11156 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3065 df-ral 3080 df-rex 3090 df-rab 3418 df-v 3459 df-sbc 3748 df-csb 3856 df-dif 3910 df-un 3912 df-in 3914 df-ss 3924 df-nul 4289 df-if 4484 df-pw 4560 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4869 df-br 5106 df-opab 5168 df-mpt 5187 df-id 5547 df-xp 5658 df-rel 5659 df-cnv 5660 df-co 5661 df-dm 5662 df-rn 5663 df-res 5664 df-ima 5665 df-iota 6481 df-fun 6527 df-fn 6528 df-f 6529 df-f1 6530 df-fo 6531 df-f1o 6532 df-fv 6533 df-ov 7403 df-oprab 7404 df-mpo 7405 df-er 8682 df-en 8932 df-dom 8933 df-sdom 8934 df-pnf 11233 df-mnf 11234 df-xr 11235 df-xadd 13129 |
| This theorem is referenced by: xlt2add 13277 |
| Copyright terms: Public domain | W3C validator |