| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rexadd | Structured version Visualization version GIF version | ||
| Description: The extended real addition operation when both arguments are real. (Contributed by Mario Carneiro, 20-Aug-2015.) |
| Ref | Expression |
|---|---|
| rexadd | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rexr 11286 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 2 | rexr 11286 | . . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
| 3 | xaddval 13244 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 +𝑒 𝐵) = if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))))) | |
| 4 | 1, 2, 3 | syl2an 596 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))))) |
| 5 | renepnf 11288 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) | |
| 6 | ifnefalse 4517 | . . . . 5 ⊢ (𝐴 ≠ +∞ → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) | |
| 7 | 5, 6 | syl 17 | . . . 4 ⊢ (𝐴 ∈ ℝ → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) |
| 8 | renemnf 11289 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ -∞) | |
| 9 | ifnefalse 4517 | . . . . 5 ⊢ (𝐴 ≠ -∞ → if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) | |
| 10 | 8, 9 | syl 17 | . . . 4 ⊢ (𝐴 ∈ ℝ → if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) |
| 11 | 7, 10 | eqtrd 2771 | . . 3 ⊢ (𝐴 ∈ ℝ → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) |
| 12 | renepnf 11288 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ≠ +∞) | |
| 13 | ifnefalse 4517 | . . . . 5 ⊢ (𝐵 ≠ +∞ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) | |
| 14 | 12, 13 | syl 17 | . . . 4 ⊢ (𝐵 ∈ ℝ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) |
| 15 | renemnf 11289 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ≠ -∞) | |
| 16 | ifnefalse 4517 | . . . . 5 ⊢ (𝐵 ≠ -∞ → if(𝐵 = -∞, -∞, (𝐴 + 𝐵)) = (𝐴 + 𝐵)) | |
| 17 | 15, 16 | syl 17 | . . . 4 ⊢ (𝐵 ∈ ℝ → if(𝐵 = -∞, -∞, (𝐴 + 𝐵)) = (𝐴 + 𝐵)) |
| 18 | 14, 17 | eqtrd 2771 | . . 3 ⊢ (𝐵 ∈ ℝ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = (𝐴 + 𝐵)) |
| 19 | 11, 18 | sylan9eq 2791 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = (𝐴 + 𝐵)) |
| 20 | 4, 19 | eqtrd 2771 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2933 ifcif 4505 (class class class)co 7410 ℝcr 11133 0cc0 11134 + caddc 11137 +∞cpnf 11271 -∞cmnf 11272 ℝ*cxr 11273 +𝑒 cxad 13131 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 ax-sep 5271 ax-nul 5281 ax-pow 5340 ax-pr 5407 ax-un 7734 ax-cnex 11190 ax-resscn 11191 ax-1cn 11192 ax-icn 11193 ax-addcl 11194 ax-mulcl 11196 ax-i2m1 11202 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3062 df-rab 3421 df-v 3466 df-sbc 3771 df-csb 3880 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-pw 4582 df-sn 4607 df-pr 4609 df-op 4613 df-uni 4889 df-br 5125 df-opab 5187 df-mpt 5207 df-id 5553 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6489 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-ov 7413 df-oprab 7414 df-mpo 7415 df-er 8724 df-en 8965 df-dom 8966 df-sdom 8967 df-pnf 11276 df-mnf 11277 df-xr 11278 df-xadd 13134 |
| This theorem is referenced by: rexsub 13254 rexaddd 13255 xnn0xaddcl 13256 xaddnemnf 13257 xaddnepnf 13258 xnegid 13259 xaddcom 13261 xaddrid 13262 xnn0xadd0 13268 xnegdi 13269 xaddass 13270 xadddilem 13315 x2times 13320 hashunx 14409 hashunsnggt 14417 isxmet2d 24271 xmeter 24377 vtxdgfival 29454 1loopgrvd2 29488 vdegp1bi 29522 xlt2addrd 32741 xrsmulgzz 33006 xrge0slmod 33368 xrge0iifhom 33973 esumfsupre 34107 esumpfinvallem 34110 omssubadd 34337 probun 34456 heicant 37684 cntotbnd 37825 heiborlem6 37845 supxrgelem 45331 supxrge 45332 infrpge 45345 xrlexaddrp 45346 ovolsplit 45984 sge0tsms 46376 sge0pr 46390 sge0resplit 46402 sge0split 46405 sge0iunmptlemfi 46409 sge0iunmptlemre 46411 sge0xaddlem1 46429 sge0xaddlem2 46430 carageniuncllem1 46517 carageniuncllem2 46518 hoidmv1lelem2 46588 hoidmvlelem2 46592 hspmbllem3 46624 |
| Copyright terms: Public domain | W3C validator |