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

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

Proof of Theorem xaddpnf1
StepHypRef Expression
1 pnfxr 11344 . . 3 +∞ ∈ ℝ*
2 xaddval 13334 . . 3 ((𝐴 ∈ ℝ* ∧ +∞ ∈ ℝ*) → (𝐴 +𝑒 +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))))
31, 2mpan2 704 . 2 (𝐴 ∈ ℝ* → (𝐴 +𝑒 +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))))
4 pnfnemnf 11345 . . . . 5 +∞ ≠ -∞
5 ifnefalse 4494 . . . . 5 (+∞ ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞)
64, 5mp1i 14 . . . 4 (𝐴 ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞)
7 ifnefalse 4494 . . . . 5 (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))
8 eqid 2761 . . . . . 6 +∞ = +∞
98iftruei 4489 . . . . 5 if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))) = +∞
107, 9eqtrdi 2812 . . . 4 (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = +∞)
116, 10ifeq12d 4504 . . 3 (𝐴 ≠ -∞ → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = if(𝐴 = +∞, +∞, +∞))
12 ifid 4523 . . 3 if(𝐴 = +∞, +∞, +∞) = +∞
1311, 12eqtrdi 2812 . 2 (𝐴 ≠ -∞ → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = +∞)
143, 13sylan9eq 2816 1 ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +𝑒 +∞) = +∞)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  ifcif 4482  (class class class)co 7412  0cc0 11181   + caddc 11184  +∞cpnf 11321  -∞cmnf 11322  ℝ*cxr 11323   +𝑒 cxad 13220
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740  ax-cnex 11237  ax-1cn 11239  ax-icn 11240  ax-addcl 11241  ax-mulcl 11243  ax-i2m1 11249
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-iota 6487  df-fun 6533  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-pnf 11326  df-mnf 11327  df-xr 11328  df-xadd 13223
This theorem is used by:  xnn0xaddcl  13346  xaddnemnf  13347  xaddcom  13351  xnn0xadd0  13358  xnegdi  13359  xaddass  13360  xleadd1a  13364  xlt2add  13371  xsubge0  13372  xlesubadd  13374  xadddilem  13405  xrsdsreclblem  21699  isxmet2d  24626  xrge0iifhom  34551  esumpr2  34681  hasheuni  34699  carsgclctunlem2  34934  ovolsplit  46942  sge0pr  47348  sge0split  47363  sge0xadd  47389
  Copyright terms: Public domain W3C validator