| 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 11220 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 2 | rexr 11220 | . . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
| 3 | xaddval 13183 | . . 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 11222 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) | |
| 6 | ifnefalse 4500 | . . . . 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 11223 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ -∞) | |
| 9 | ifnefalse 4500 | . . . . 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 2764 | . . 3 ⊢ (𝐴 ∈ ℝ → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) |
| 12 | renepnf 11222 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ≠ +∞) | |
| 13 | ifnefalse 4500 | . . . . 5 ⊢ (𝐵 ≠ +∞ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) | |
| 14 | 12, 13 | syl 17 | . . . 4 ⊢ (𝐵 ∈ ℝ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) |
| 15 | renemnf 11223 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ≠ -∞) | |
| 16 | ifnefalse 4500 | . . . . 5 ⊢ (𝐵 ≠ -∞ → if(𝐵 = -∞, -∞, (𝐴 + 𝐵)) = (𝐴 + 𝐵)) | |
| 17 | 15, 16 | syl 17 | . . . 4 ⊢ (𝐵 ∈ ℝ → if(𝐵 = -∞, -∞, (𝐴 + 𝐵)) = (𝐴 + 𝐵)) |
| 18 | 14, 17 | eqtrd 2764 | . . 3 ⊢ (𝐵 ∈ ℝ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = (𝐴 + 𝐵)) |
| 19 | 11, 18 | sylan9eq 2784 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = (𝐴 + 𝐵)) |
| 20 | 4, 19 | eqtrd 2764 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ifcif 4488 (class class class)co 7387 ℝcr 11067 0cc0 11068 + caddc 11071 +∞cpnf 11205 -∞cmnf 11206 ℝ*cxr 11207 +𝑒 cxad 13070 |
| 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 2701 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-mulcl 11130 ax-i2m1 11136 |
| 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 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4872 df-br 5108 df-opab 5170 df-mpt 5189 df-id 5533 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-ov 7390 df-oprab 7391 df-mpo 7392 df-er 8671 df-en 8919 df-dom 8920 df-sdom 8921 df-pnf 11210 df-mnf 11211 df-xr 11212 df-xadd 13073 |
| This theorem is referenced by: rexsub 13193 rexaddd 13194 xnn0xaddcl 13195 xaddnemnf 13196 xaddnepnf 13197 xnegid 13198 xaddcom 13200 xaddrid 13201 xnn0xadd0 13207 xnegdi 13208 xaddass 13209 xadddilem 13254 x2times 13259 hashunx 14351 hashunsnggt 14359 isxmet2d 24215 xmeter 24321 vtxdgfival 29397 1loopgrvd2 29431 vdegp1bi 29465 xlt2addrd 32682 xrsmulgzz 32947 xrge0slmod 33319 xrge0iifhom 33927 esumfsupre 34061 esumpfinvallem 34064 omssubadd 34291 probun 34410 heicant 37649 cntotbnd 37790 heiborlem6 37810 supxrgelem 45333 supxrge 45334 infrpge 45347 xrlexaddrp 45348 ovolsplit 45986 sge0tsms 46378 sge0pr 46392 sge0resplit 46404 sge0split 46407 sge0iunmptlemfi 46411 sge0iunmptlemre 46413 sge0xaddlem1 46431 sge0xaddlem2 46432 carageniuncllem1 46519 carageniuncllem2 46520 hoidmv1lelem2 46590 hoidmvlelem2 46594 hspmbllem3 46626 |
| Copyright terms: Public domain | W3C validator |