| 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 | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +𝑒 +∞) = +∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pnfxr 11229 | . . 3 ⊢ +∞ ∈ ℝ* | |
| 2 | xaddval 13219 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ +∞ ∈ ℝ*) → (𝐴 +𝑒 +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))))) | |
| 3 | 1, 2 | mpan2 701 | . 2 ⊢ (𝐴 ∈ ℝ* → (𝐴 +𝑒 +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))))) |
| 4 | pnfnemnf 11230 | . . . . 5 ⊢ +∞ ≠ -∞ | |
| 5 | ifnefalse 4489 | . . . . 5 ⊢ (+∞ ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞) | |
| 6 | 4, 5 | mp1i 13 | . . . 4 ⊢ (𝐴 ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞) |
| 7 | ifnefalse 4489 | . . . . 5 ⊢ (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) | |
| 8 | eqid 2761 | . . . . . 6 ⊢ +∞ = +∞ | |
| 9 | 8 | iftruei 4484 | . . . . 5 ⊢ if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))) = +∞ |
| 10 | 7, 9 | eqtrdi 2812 | . . . 4 ⊢ (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = +∞) |
| 11 | 6, 10 | ifeq12d 4499 | . . 3 ⊢ (𝐴 ≠ -∞ → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = if(𝐴 = +∞, +∞, +∞)) |
| 12 | ifid 4518 | . . 3 ⊢ if(𝐴 = +∞, +∞, +∞) = +∞ | |
| 13 | 11, 12 | eqtrdi 2812 | . 2 ⊢ (𝐴 ≠ -∞ → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = +∞) |
| 14 | 3, 13 | sylan9eq 2816 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +𝑒 +∞) = +∞) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ifcif 4477 (class class class)co 7390 0cc0 11066 + caddc 11069 +∞cpnf 11206 -∞cmnf 11207 ℝ*cxr 11208 +𝑒 cxad 13105 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7712 ax-cnex 11122 ax-1cn 11124 ax-icn 11125 ax-addcl 11126 ax-mulcl 11128 ax-i2m1 11134 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-sbc 3743 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-br 5098 df-opab 5160 df-id 5538 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-iota 6471 df-fun 6517 df-fv 6523 df-ov 7393 df-oprab 7394 df-mpo 7395 df-pnf 11211 df-mnf 11212 df-xr 11213 df-xadd 13108 |
| This theorem is referenced by: xnn0xaddcl 13231 xaddnemnf 13232 xaddcom 13236 xnn0xadd0 13243 xnegdi 13244 xaddass 13245 xleadd1a 13249 xlt2add 13256 xsubge0 13257 xlesubadd 13259 xadddilem 13290 xrsdsreclblem 21452 isxmet2d 24374 xrge0iifhom 34194 esumpr2 34324 hasheuni 34342 carsgclctunlem2 34576 ovolsplit 46522 sge0pr 46928 sge0split 46943 sge0xadd 46969 |
| Copyright terms: Public domain | W3C validator |