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

Theorem xaddpnf1 10259
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 8379 . . . 4 +∞ ∈ ℝ*
2 xaddval 10258 . . . 4 ((𝐴 ∈ ℝ* ∧ +∞ ∈ ℝ*) → (𝐴 +𝑒 +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))))
31, 2mpan2 429 . . 3 (𝐴 ∈ ℝ* → (𝐴 +𝑒 +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))))
43adantr 276 . 2 ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +𝑒 +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))))
5 pnfnemnf 8381 . . . . 5 +∞ ≠ -∞
6 ifnefalse 3651 . . . . 5 (+∞ ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞)
75, 6mp1i 10 . . . 4 (𝐴 ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞)
8 ifnefalse 3651 . . . . 5 (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))
9 eqid 2238 . . . . . 6 +∞ = +∞
109iftruei 3646 . . . . 5 if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))) = +∞
118, 10eqtrdi 2287 . . . 4 (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = +∞)
127, 11ifeq12d 3660 . . 3 (𝐴 ≠ -∞ → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = if(𝐴 = +∞, +∞, +∞))
13 xrpnfdc 10255 . . . 4 (𝐴 ∈ ℝ* → DECID 𝐴 = +∞)
14 ifiddc 3676 . . . 4 (DECID 𝐴 = +∞ → if(𝐴 = +∞, +∞, +∞) = +∞)
1513, 14syl 14 . . 3 (𝐴 ∈ ℝ* → if(𝐴 = +∞, +∞, +∞) = +∞)
1612, 15sylan9eqr 2293 . 2 ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = +∞)
174, 16eqtrd 2271 1 ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +𝑒 +∞) = +∞)
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104  DECID wdc 846   = wceq 1402   ∈ wcel 2209   ≠ wne 2420  ifcif 3638  (class class class)co 6085  0cc0 8180   + caddc 8183  +∞cpnf 8358  -∞cmnf 8359  ℝ*cxr 8360   +𝑒 cxad 10183
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1re 8274  ax-addrcl 8277  ax-rnegex 8289
This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8363  df-mnf 8364  df-xr 8365  df-xadd 10186
This theorem is used by:  xaddnemnf  10270  xaddcom  10274  xnn0xadd0  10280  xnegdi  10281  xaddass  10282  xleadd1a  10286  xlt2add  10293  xsubge0  10294  xposdif  10295  xlesubadd  10296  xrbdtri  12061  isxmet2d  15540
  Copyright terms: Public domain W3C validator