| 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 11243 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 2 | rexr 11243 | . . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
| 3 | xaddval 13240 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → (𝐴 +𝑒 𝐵) = if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))))) | |
| 4 | 1, 2, 3 | syl2an 607 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))))) |
| 5 | renepnf 11245 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) | |
| 6 | ifnefalse 4495 | . . . . 5 ⊢ (𝐴 ≠ +∞ → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) | |
| 7 | 5, 6 | syl 18 | . . . 4 ⊢ (𝐴 ∈ ℝ → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) |
| 8 | renemnf 11246 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ -∞) | |
| 9 | ifnefalse 4495 | . . . . 5 ⊢ (𝐴 ≠ -∞ → if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) | |
| 10 | 8, 9 | syl 18 | . . . 4 ⊢ (𝐴 ∈ ℝ → if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) |
| 11 | 7, 10 | eqtrd 2800 | . . 3 ⊢ (𝐴 ∈ ℝ → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) |
| 12 | renepnf 11245 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ≠ +∞) | |
| 13 | ifnefalse 4495 | . . . . 5 ⊢ (𝐵 ≠ +∞ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) | |
| 14 | 12, 13 | syl 18 | . . . 4 ⊢ (𝐵 ∈ ℝ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) |
| 15 | renemnf 11246 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ≠ -∞) | |
| 16 | ifnefalse 4495 | . . . . 5 ⊢ (𝐵 ≠ -∞ → if(𝐵 = -∞, -∞, (𝐴 + 𝐵)) = (𝐴 + 𝐵)) | |
| 17 | 15, 16 | syl 18 | . . . 4 ⊢ (𝐵 ∈ ℝ → if(𝐵 = -∞, -∞, (𝐴 + 𝐵)) = (𝐴 + 𝐵)) |
| 18 | 14, 17 | eqtrd 2800 | . . 3 ⊢ (𝐵 ∈ ℝ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = (𝐴 + 𝐵)) |
| 19 | 11, 18 | sylan9eq 2820 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = (𝐴 + 𝐵)) |
| 20 | 4, 19 | eqtrd 2800 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1563 ∈ wcel 2145 ≠ wne 2960 ifcif 4483 (class class class)co 7400 ℝcr 11087 0cc0 11088 + 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-mulcl 11150 ax-i2m1 11156 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 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: rexsub 13250 rexaddd 13251 xnn0xaddcl 13252 xaddnemnf 13253 xaddnepnf 13254 xnegid 13255 xaddcom 13257 xaddrid 13258 xnn0xadd0 13264 xnegdi 13265 xaddass 13266 xadddilem 13311 x2times 13316 hashunx 14413 hashunsnggt 14421 isxmet2d 24445 xmeter 24551 vtxdgfival 29728 1loopgrvd2 29762 vdegp1bi 29796 xlt2addrd 33016 xrsmulgzz 33242 xrge0slmod 33583 xrge0iifhom 34244 esumfsupre 34378 esumpfinvallem 34381 omssubadd 34607 probun 34726 heicant 38166 cntotbnd 38307 heiborlem6 38327 supxrgelem 45911 supxrge 45912 infrpge 45925 xrlexaddrp 45926 ovolsplit 46560 sge0tsms 46952 sge0pr 46966 sge0resplit 46978 sge0split 46981 sge0iunmptlemfi 46985 sge0iunmptlemre 46987 sge0xaddlem1 47005 sge0xaddlem2 47006 carageniuncllem1 47093 carageniuncllem2 47094 hoidmv1lelem2 47164 hoidmvlelem2 47168 hspmbllem3 47200 |
| Copyright terms: Public domain | W3C validator |