ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  xaddpnf1 GIF version

Theorem xaddpnf1 10080
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 8231 . . . 4 +∞ ∈ ℝ*
2 xaddval 10079 . . . 4 ((𝐴 ∈ ℝ* ∧ +∞ ∈ ℝ*) → (𝐴 +𝑒 +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))))
31, 2mpan2 425 . . 3 (𝐴 ∈ ℝ* → (𝐴 +𝑒 +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))))
43adantr 276 . 2 ((𝐴 ∈ ℝ*𝐴 ≠ -∞) → (𝐴 +𝑒 +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))))
5 pnfnemnf 8233 . . . . 5 +∞ ≠ -∞
6 ifnefalse 3616 . . . . 5 (+∞ ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞)
75, 6mp1i 10 . . . 4 (𝐴 ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞)
8 ifnefalse 3616 . . . . 5 (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))
9 eqid 2231 . . . . . 6 +∞ = +∞
109iftruei 3611 . . . . 5 if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))) = +∞
118, 10eqtrdi 2280 . . . 4 (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = +∞)
127, 11ifeq12d 3625 . . 3 (𝐴 ≠ -∞ → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = if(𝐴 = +∞, +∞, +∞))
13 xrpnfdc 10076 . . . 4 (𝐴 ∈ ℝ*DECID 𝐴 = +∞)
14 ifiddc 3641 . . . 4 (DECID 𝐴 = +∞ → if(𝐴 = +∞, +∞, +∞) = +∞)
1513, 14syl 14 . . 3 (𝐴 ∈ ℝ* → if(𝐴 = +∞, +∞, +∞) = +∞)
1612, 15sylan9eqr 2286 . 2 ((𝐴 ∈ ℝ*𝐴 ≠ -∞) → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = +∞)
174, 16eqtrd 2264 1 ((𝐴 ∈ ℝ*𝐴 ≠ -∞) → (𝐴 +𝑒 +∞) = +∞)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  DECID wdc 841   = wceq 1397  wcel 2202  wne 2402  ifcif 3605  (class class class)co 6017  0cc0 8031   + caddc 8034  +∞cpnf 8210  -∞cmnf 8211  *cxr 8212   +𝑒 cxad 10004
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8122  ax-resscn 8123  ax-1re 8125  ax-addrcl 8128  ax-rnegex 8140
This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-rab 2519  df-v 2804  df-sbc 3032  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-if 3606  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-iota 5286  df-fun 5328  df-fv 5334  df-ov 6020  df-oprab 6021  df-mpo 6022  df-pnf 8215  df-mnf 8216  df-xr 8217  df-xadd 10007
This theorem is referenced by:  xaddnemnf  10091  xaddcom  10095  xnn0xadd0  10101  xnegdi  10102  xaddass  10103  xleadd1a  10107  xlt2add  10114  xsubge0  10115  xposdif  10116  xlesubadd  10117  xrbdtri  11836  isxmet2d  15071
  Copyright terms: Public domain W3C validator