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

Theorem xaddpnf1 13360
Description: Addition of positive infinity on the right. (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
xaddpnf1 ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +e +∞) = +∞)

Proof of Theorem xaddpnf1
StepHypRef Expression
1 pnfxr 11367 . . 3 +∞ ∈ ℝ*
2 xaddval 13357 . . 3 ((𝐴 ∈ ℝ* ∧ +∞ ∈ ℝ*) → (𝐴 +e +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))))
31, 2mpan2 704 . 2 (𝐴 ∈ ℝ* → (𝐴 +e +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))))
4 pnfnemnf 11368 . . . . 5 +∞ ≠ -∞
5 ifnefalse 4493 . . . . 5 (+∞ ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞)
64, 5mp1i 14 . . . 4 (𝐴 ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞)
7 ifnefalse 4493 . . . . 5 (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))
8 eqid 2760 . . . . . 6 +∞ = +∞
98iftruei 4488 . . . . 5 if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))) = +∞
107, 9eqtrdi 2811 . . . 4 (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = +∞)
116, 10ifeq12d 4503 . . 3 (𝐴 ≠ -∞ → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = if(𝐴 = +∞, +∞, +∞))
12 ifid 4522 . . 3 if(𝐴 = +∞, +∞, +∞) = +∞
1311, 12eqtrdi 2811 . 2 (𝐴 ≠ -∞ → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = +∞)
143, 13sylan9eq 2815 1 ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +e +∞) = +∞)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ifcif 4481  (class class class)co 7421  0cc0 11204   + caddc 11207  +∞cpnf 11344  -∞cmnf 11345  ℝ*cxr 11346   +e cxad 13243
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752  ax-cnex 11260  ax-1cn 11262  ax-icn 11263  ax-addcl 11264  ax-mulcl 11266  ax-i2m1 11272
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6494  df-fun 6541  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-pnf 11349  df-mnf 11350  df-xr 11351  df-xadd 13246
This theorem is used by:  xnn0xaddcl  13369  xaddnemnf  13370  xaddcom  13374  xnn0xadd0  13381  xnegdi  13382  xaddass  13383  xleadd1a  13387  xlt2add  13394  xsubge0  13395  xlesubadd  13397  xadddilem  13428  xrsdsreclblem  21725  isxmet2d  24652  xrge0iifhom  34616  esumpr2  34746  hasheuni  34764  carsgclctunlem2  34998  ovolsplit  47092  sge0pr  47498  sge0split  47513  sge0xadd  47539
  Copyright terms: Public domain W3C validator