MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rexadd Structured version   Visualization version   GIF version

Theorem rexadd 13128
Description: The extended real addition operation when both arguments are real. (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
rexadd ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵))

Proof of Theorem rexadd
StepHypRef Expression
1 rexr 11155 . . 3 (𝐴 ∈ ℝ → 𝐴 ∈ ℝ*)
2 rexr 11155 . . 3 (𝐵 ∈ ℝ → 𝐵 ∈ ℝ*)
3 xaddval 13119 . . 3 ((𝐴 ∈ ℝ*𝐵 ∈ ℝ*) → (𝐴 +𝑒 𝐵) = if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))))
41, 2, 3syl2an 596 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))))
5 renepnf 11157 . . . . 5 (𝐴 ∈ ℝ → 𝐴 ≠ +∞)
6 ifnefalse 4487 . . . . 5 (𝐴 ≠ +∞ → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))))
75, 6syl 17 . . . 4 (𝐴 ∈ ℝ → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))))
8 renemnf 11158 . . . . 5 (𝐴 ∈ ℝ → 𝐴 ≠ -∞)
9 ifnefalse 4487 . . . . 5 (𝐴 ≠ -∞ → if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))
108, 9syl 17 . . . 4 (𝐴 ∈ ℝ → if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))
117, 10eqtrd 2766 . . 3 (𝐴 ∈ ℝ → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))
12 renepnf 11157 . . . . 5 (𝐵 ∈ ℝ → 𝐵 ≠ +∞)
13 ifnefalse 4487 . . . . 5 (𝐵 ≠ +∞ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))
1412, 13syl 17 . . . 4 (𝐵 ∈ ℝ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = if(𝐵 = -∞, -∞, (𝐴 + 𝐵)))
15 renemnf 11158 . . . . 5 (𝐵 ∈ ℝ → 𝐵 ≠ -∞)
16 ifnefalse 4487 . . . . 5 (𝐵 ≠ -∞ → if(𝐵 = -∞, -∞, (𝐴 + 𝐵)) = (𝐴 + 𝐵))
1715, 16syl 17 . . . 4 (𝐵 ∈ ℝ → if(𝐵 = -∞, -∞, (𝐴 + 𝐵)) = (𝐴 + 𝐵))
1814, 17eqtrd 2766 . . 3 (𝐵 ∈ ℝ → if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))) = (𝐴 + 𝐵))
1911, 18sylan9eq 2786 . 2 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → if(𝐴 = +∞, if(𝐵 = -∞, 0, +∞), if(𝐴 = -∞, if(𝐵 = +∞, 0, -∞), if(𝐵 = +∞, +∞, if(𝐵 = -∞, -∞, (𝐴 + 𝐵))))) = (𝐴 + 𝐵))
204, 19eqtrd 2766 1 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 +𝑒 𝐵) = (𝐴 + 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2111  wne 2928  ifcif 4475  (class class class)co 7346  cr 11002  0cc0 11003   + caddc 11006  +∞cpnf 11140  -∞cmnf 11141  *cxr 11142   +𝑒 cxad 13006
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5234  ax-nul 5244  ax-pow 5303  ax-pr 5370  ax-un 7668  ax-cnex 11059  ax-resscn 11060  ax-1cn 11061  ax-icn 11062  ax-addcl 11063  ax-mulcl 11065  ax-i2m1 11071
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-nel 3033  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-sbc 3742  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4476  df-pw 4552  df-sn 4577  df-pr 4579  df-op 4583  df-uni 4860  df-br 5092  df-opab 5154  df-mpt 5173  df-id 5511  df-xp 5622  df-rel 5623  df-cnv 5624  df-co 5625  df-dm 5626  df-rn 5627  df-res 5628  df-ima 5629  df-iota 6437  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-er 8622  df-en 8870  df-dom 8871  df-sdom 8872  df-pnf 11145  df-mnf 11146  df-xr 11147  df-xadd 13009
This theorem is referenced by:  rexsub  13129  rexaddd  13130  xnn0xaddcl  13131  xaddnemnf  13132  xaddnepnf  13133  xnegid  13134  xaddcom  13136  xaddrid  13137  xnn0xadd0  13143  xnegdi  13144  xaddass  13145  xadddilem  13190  x2times  13195  hashunx  14290  hashunsnggt  14298  isxmet2d  24240  xmeter  24346  vtxdgfival  29446  1loopgrvd2  29480  vdegp1bi  29514  xlt2addrd  32737  xrsmulgzz  32985  xrge0slmod  33308  xrge0iifhom  33945  esumfsupre  34079  esumpfinvallem  34082  omssubadd  34308  probun  34427  heicant  37694  cntotbnd  37835  heiborlem6  37855  supxrgelem  45375  supxrge  45376  infrpge  45389  xrlexaddrp  45390  ovolsplit  46025  sge0tsms  46417  sge0pr  46431  sge0resplit  46443  sge0split  46446  sge0iunmptlemfi  46450  sge0iunmptlemre  46452  sge0xaddlem1  46470  sge0xaddlem2  46471  carageniuncllem1  46558  carageniuncllem2  46559  hoidmv1lelem2  46629  hoidmvlelem2  46633  hspmbllem3  46665
  Copyright terms: Public domain W3C validator