| 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 | ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xrnemnf 13033 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ↔ (𝐴 ∈ ℝ ∨ 𝐴 = +∞)) | |
| 2 | xrnemnf 13033 | . . . 4 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞) ↔ (𝐵 ∈ ℝ ∨ 𝐵 = +∞)) | |
| 3 | rexadd 13149 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) | |
| 4 | readdcl 11111 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ) | |
| 5 | 3, 4 | eqeltrd 2836 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ∈ ℝ) |
| 6 | 5 | renemnfd 11186 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| 7 | oveq2 7366 | . . . . . . 7 ⊢ (𝐵 = +∞ → (𝐴 +𝑒 𝐵) = (𝐴 +𝑒 +∞)) | |
| 8 | rexr 11180 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 9 | renemnf 11183 | . . . . . . . 8 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ -∞) | |
| 10 | xaddpnf1 13143 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +𝑒 +∞) = +∞) | |
| 11 | 8, 9, 10 | syl2anc 584 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → (𝐴 +𝑒 +∞) = +∞) |
| 12 | 7, 11 | sylan9eqr 2793 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 +𝑒 𝐵) = +∞) |
| 13 | pnfnemnf 11189 | . . . . . . 7 ⊢ +∞ ≠ -∞ | |
| 14 | 13 | a1i 11 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → +∞ ≠ -∞) |
| 15 | 12, 14 | eqnetrd 2999 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 = +∞) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| 16 | 6, 15 | jaodan 959 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ ∨ 𝐵 = +∞)) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| 17 | 2, 16 | sylan2b 594 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| 18 | oveq1 7365 | . . . . 5 ⊢ (𝐴 = +∞ → (𝐴 +𝑒 𝐵) = (+∞ +𝑒 𝐵)) | |
| 19 | xaddpnf2 13144 | . . . . 5 ⊢ ((𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞) → (+∞ +𝑒 𝐵) = +∞) | |
| 20 | 18, 19 | sylan9eq 2791 | . . . 4 ⊢ ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +𝑒 𝐵) = +∞) |
| 21 | 13 | a1i 11 | . . . 4 ⊢ ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → +∞ ≠ -∞) |
| 22 | 20, 21 | eqnetrd 2999 | . . 3 ⊢ ((𝐴 = +∞ ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| 23 | 17, 22 | jaoian 958 | . 2 ⊢ (((𝐴 ∈ ℝ ∨ 𝐴 = +∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| 24 | 1, 23 | sylanb 581 | 1 ⊢ (((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) ∧ (𝐵 ∈ ℝ* ∧ 𝐵 ≠ -∞)) → (𝐴 +𝑒 𝐵) ≠ -∞) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 (class class class)co 7358 ℝcr 11027 + caddc 11031 +∞cpnf 11165 -∞cmnf 11166 ℝ*cxr 11167 +𝑒 cxad 13026 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-i2m1 11096 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-mpt 5180 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-ov 7361 df-oprab 7362 df-mpo 7363 df-er 8635 df-en 8886 df-dom 8887 df-sdom 8888 df-pnf 11170 df-mnf 11171 df-xr 11172 df-xadd 13029 |
| This theorem is referenced by: xaddass 13166 xlt2add 13177 xadd4d 13220 xrs1mnd 21397 |
| Copyright terms: Public domain | W3C validator |