| 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 11256 | . . 3 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*) | |
| 2 | rexr 11256 | . . 3 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*) | |
| 3 | xaddval 13250 | . . 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 11258 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ +∞) | |
| 6 | ifnefalse 4500 | . . . . 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 11259 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ≠ -∞) | |
| 9 | ifnefalse 4500 | . . . . 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 2798 | . . 3 ⊢ (𝐴 ∈ ℝ → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) |
| 12 | renepnf 11258 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ≠ +∞) | |
| 13 | ifnefalse 4500 | . . . . 5 ⊢ (𝐵 ≠ +∞ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) | |
| 14 | 12, 13 | syl 18 | . . . 4 ⊢ (𝐵 ∈ ℝ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) |
| 15 | renemnf 11259 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ≠ -∞) | |
| 16 | ifnefalse 4500 | . . . . 5 ⊢ (𝐵 ≠ -∞ → if(𝐵 = -∞, -∞, (𝐴 + 𝐵)) = (𝐴 + 𝐵)) | |
| 17 | 15, 16 | syl 18 | . . . 4 ⊢ (𝐵 ∈ ℝ → if(𝐵 = -∞, -∞, (𝐴 + 𝐵)) = (𝐴 + 𝐵)) |
| 18 | 14, 17 | eqtrd 2798 | . . 3 ⊢ (𝐵 ∈ ℝ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = (𝐴 + 𝐵)) |
| 19 | 11, 18 | sylan9eq 2818 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = (𝐴 + 𝐵)) |
| 20 | 4, 19 | eqtrd 2798 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ifcif 4488 (class class class)co 7412 ℝcr 11100 0cc0 11101 + caddc 11104 +∞cpnf 11241 -∞cmnf 11242 ℝ*cxr 11243 +𝑒 cxad 13136 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 ax-cnex 11157 ax-resscn 11158 ax-1cn 11159 ax-icn 11160 ax-addcl 11161 ax-mulcl 11163 ax-i2m1 11169 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-op 4597 df-uni 4874 df-br 5111 df-opab 5175 df-mpt 5194 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-ov 7415 df-oprab 7416 df-mpo 7417 df-er 8695 df-en 8945 df-dom 8946 df-sdom 8947 df-pnf 11246 df-mnf 11247 df-xr 11248 df-xadd 13139 |
| This theorem is referenced by: rexsub 13260 rexaddd 13261 xnn0xaddcl 13262 xaddnemnf 13263 xaddnepnf 13264 xnegid 13265 xaddcom 13267 xaddrid 13268 xnn0xadd0 13274 xnegdi 13275 xaddass 13276 xadddilem 13321 x2times 13326 hashunx 14424 hashunsnggt 14432 isxmet2d 24465 xmeter 24571 vtxdgfival 29797 1loopgrvd2 29831 vdegp1bi 29865 xlt2addrd 33082 xrsmulgzz 33307 xrge0slmod 33646 xrge0iifhom 34305 esumfsupre 34439 esumpfinvallem 34442 omssubadd 34668 probun 34787 heicant 38284 cntotbnd 38425 heiborlem6 38445 supxrgelem 46033 supxrge 46034 infrpge 46047 xrlexaddrp 46048 ovolsplit 46682 sge0tsms 47074 sge0pr 47088 sge0resplit 47100 sge0split 47103 sge0iunmptlemfi 47107 sge0iunmptlemre 47109 sge0xaddlem1 47127 sge0xaddlem2 47128 carageniuncllem1 47215 carageniuncllem2 47216 hoidmv1lelem2 47286 hoidmvlelem2 47290 hspmbllem3 47322 |
| Copyright terms: Public domain | W3C validator |