![]() |
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 10402 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
2 | rexr 10402 | . . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
3 | xaddval 12342 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 +𝑒 𝐵) = if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))))) | |
4 | 1, 2, 3 | syl2an 591 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))))) |
5 | renepnf 10404 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) | |
6 | ifnefalse 4318 | . . . . 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 10405 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ -∞) | |
9 | ifnefalse 4318 | . . . . 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 2861 | . . 3 ⊢ (𝐴 ∈ ℝ → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) |
12 | renepnf 10404 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ≠ +∞) | |
13 | ifnefalse 4318 | . . . . 5 ⊢ (𝐵 ≠ +∞ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) | |
14 | 12, 13 | syl 17 | . . . 4 ⊢ (𝐵 ∈ ℝ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) |
15 | renemnf 10405 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ≠ -∞) | |
16 | ifnefalse 4318 | . . . . 5 ⊢ (𝐵 ≠ -∞ → if(𝐵 = -∞, -∞, (𝐴 + 𝐵)) = (𝐴 + 𝐵)) | |
17 | 15, 16 | syl 17 | . . . 4 ⊢ (𝐵 ∈ ℝ → if(𝐵 = -∞, -∞, (𝐴 + 𝐵)) = (𝐴 + 𝐵)) |
18 | 14, 17 | eqtrd 2861 | . . 3 ⊢ (𝐵 ∈ ℝ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = (𝐴 + 𝐵)) |
19 | 11, 18 | sylan9eq 2881 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = (𝐴 + 𝐵)) |
20 | 4, 19 | eqtrd 2861 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 386 = wceq 1658 ∈ wcel 2166 ≠ wne 2999 ifcif 4306 (class class class)co 6905 ℝcr 10251 0cc0 10252 + caddc 10255 +∞cpnf 10388 -∞cmnf 10389 ℝ*cxr 10390 +𝑒 cxad 12230 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1896 ax-4 1910 ax-5 2011 ax-6 2077 ax-7 2114 ax-8 2168 ax-9 2175 ax-10 2194 ax-11 2209 ax-12 2222 ax-13 2391 ax-ext 2803 ax-sep 5005 ax-nul 5013 ax-pow 5065 ax-pr 5127 ax-un 7209 ax-cnex 10308 ax-resscn 10309 ax-1cn 10310 ax-icn 10311 ax-addcl 10312 ax-mulcl 10314 ax-i2m1 10320 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 881 df-3an 1115 df-tru 1662 df-ex 1881 df-nf 1885 df-sb 2070 df-mo 2605 df-eu 2640 df-clab 2812 df-cleq 2818 df-clel 2821 df-nfc 2958 df-ne 3000 df-nel 3103 df-ral 3122 df-rex 3123 df-rab 3126 df-v 3416 df-sbc 3663 df-csb 3758 df-dif 3801 df-un 3803 df-in 3805 df-ss 3812 df-nul 4145 df-if 4307 df-pw 4380 df-sn 4398 df-pr 4400 df-op 4404 df-uni 4659 df-br 4874 df-opab 4936 df-mpt 4953 df-id 5250 df-xp 5348 df-rel 5349 df-cnv 5350 df-co 5351 df-dm 5352 df-rn 5353 df-res 5354 df-ima 5355 df-iota 6086 df-fun 6125 df-fn 6126 df-f 6127 df-f1 6128 df-fo 6129 df-f1o 6130 df-fv 6131 df-ov 6908 df-oprab 6909 df-mpt2 6910 df-er 8009 df-en 8223 df-dom 8224 df-sdom 8225 df-pnf 10393 df-mnf 10394 df-xr 10395 df-xadd 12233 |
This theorem is referenced by: rexsub 12352 rexaddd 12353 xnn0xaddcl 12354 xaddnemnf 12355 xaddnepnf 12356 xnegid 12357 xaddcom 12359 xaddid1 12360 xnn0xadd0 12365 xnegdi 12366 xaddass 12367 xpncan 12369 xleadd1a 12371 xadddilem 12412 x2times 12417 hashunx 13465 isxmet2d 22502 ismet2 22508 mettri2 22516 prdsxmetlem 22543 bl2in 22575 xblss2ps 22576 xmeter 22608 methaus 22695 metustexhalf 22731 metdcnlem 23009 metnrmlem3 23034 iscau3 23446 vtxdgfival 26767 1loopgrvd2 26801 vdegp1bi 26835 xlt2addrd 30070 xrsmulgzz 30223 xrge0slmod 30389 xrge0iifhom 30528 esumfsupre 30678 esumpfinvallem 30681 omssubadd 30907 probun 31027 heicant 33988 cntotbnd 34137 heiborlem6 34157 supxrgelem 40350 supxrge 40351 infrpge 40364 xrlexaddrp 40365 ovolsplit 40999 sge0tsms 41388 sge0pr 41402 sge0resplit 41414 sge0split 41417 sge0iunmptlemfi 41421 sge0iunmptlemre 41423 sge0xaddlem1 41441 sge0xaddlem2 41442 carageniuncllem1 41529 carageniuncllem2 41530 hoidmv1lelem2 41600 hoidmvlelem2 41604 hspmbllem3 41636 |
Copyright terms: Public domain | W3C validator |