| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xaddpnf1 | Structured version Visualization version GIF version | ||
| Description: Addition of positive infinity on the right. (Contributed by Mario Carneiro, 20-Aug-2015.) |
| Ref | Expression |
|---|---|
| xaddpnf1 | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +e +∞) = +∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pnfxr 11393 | . . 3 ⊢ +∞ ∈ ℝ* | |
| 2 | xaddval 13383 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ +∞ ∈ ℝ*) → (𝐴 +e +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))))) | |
| 3 | 1, 2 | mpan2 704 | . 2 ⊢ (𝐴 ∈ ℝ* → (𝐴 +e +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))))) |
| 4 | pnfnemnf 11394 | . . . . 5 ⊢ +∞ ≠ -∞ | |
| 5 | ifnefalse 4497 | . . . . 5 ⊢ (+∞ ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞) | |
| 6 | 4, 5 | mp1i 14 | . . . 4 ⊢ (𝐴 ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞) |
| 7 | ifnefalse 4497 | . . . . 5 ⊢ (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) | |
| 8 | eqid 2763 | . . . . . 6 ⊢ +∞ = +∞ | |
| 9 | 8 | iftruei 4492 | . . . . 5 ⊢ if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))) = +∞ |
| 10 | 7, 9 | eqtrdi 2814 | . . . 4 ⊢ (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = +∞) |
| 11 | 6, 10 | ifeq12d 4507 | . . 3 ⊢ (𝐴 ≠ -∞ → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = if(𝐴 = +∞, +∞, +∞)) |
| 12 | ifid 4526 | . . 3 ⊢ if(𝐴 = +∞, +∞, +∞) = +∞ | |
| 13 | 11, 12 | eqtrdi 2814 | . 2 ⊢ (𝐴 ≠ -∞ → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = +∞) |
| 14 | 3, 13 | sylan9eq 2818 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +e +∞) = +∞) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ifcif 4485 (class class class)co 7446 0cc0 11230 + caddc 11233 +∞cpnf 11370 -∞cmnf 11371 ℝ*cxr 11372 +e cxad 13269 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-cnex 11286 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-mulcl 11292 ax-i2m1 11298 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-sbc 3743 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5172 df-id 5551 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-iota 6515 df-fun 6563 df-fv 6569 df-ov 7449 df-oprab 7450 df-mpo 7451 df-pnf 11375 df-mnf 11376 df-xr 11377 df-xadd 13272 |
| This theorem is used by: xnn0xaddcl 13395 xaddnemnf 13396 xaddcom 13400 xnn0xadd0 13407 xnegdi 13408 xaddass 13409 xleadd1a 13413 xlt2add 13420 xsubge0 13421 xlesubadd 13423 xadddilem 13454 xrsdsreclblem 21752 isxmet2d 24679 xrge0iifhom 34652 esumpr2 34782 hasheuni 34800 carsgclctunlem2 35034 ovolsplit 47213 sge0pr 47619 sge0split 47634 sge0xadd 47660 |
| Copyright terms: Public domain | W3C validator |