| 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 11198 | . . 3 ⊢ +∞ ∈ ℝ* | |
| 2 | xaddval 13150 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ +∞ ∈ ℝ*) → (𝐴 +𝑒 +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))))) | |
| 3 | 1, 2 | mpan2 692 | . 2 ⊢ (𝐴 ∈ ℝ* → (𝐴 +𝑒 +∞) = if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))))) |
| 4 | pnfnemnf 11199 | . . . . 5 ⊢ +∞ ≠ -∞ | |
| 5 | ifnefalse 4493 | . . . . 5 ⊢ (+∞ ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞) | |
| 6 | 4, 5 | mp1i 13 | . . . 4 ⊢ (𝐴 ≠ -∞ → if(+∞ = -∞, 0, +∞) = +∞) |
| 7 | ifnefalse 4493 | . . . . 5 ⊢ (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) | |
| 8 | eqid 2737 | . . . . . 6 ⊢ +∞ = +∞ | |
| 9 | 8 | iftruei 4488 | . . . . 5 ⊢ if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))) = +∞ |
| 10 | 7, 9 | eqtrdi 2788 | . . . 4 ⊢ (𝐴 ≠ -∞ → if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞)))) = +∞) |
| 11 | 6, 10 | ifeq12d 4503 | . . 3 ⊢ (𝐴 ≠ -∞ → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = if(𝐴 = +∞, +∞, +∞)) |
| 12 | ifid 4522 | . . 3 ⊢ if(𝐴 = +∞, +∞, +∞) = +∞ | |
| 13 | 11, 12 | eqtrdi 2788 | . 2 ⊢ (𝐴 ≠ -∞ → if(𝐴 = +∞, if(+∞ = -∞, 0, +∞), if(𝐴 = -∞, if(+∞ = +∞, 0, -∞), if(+∞ = +∞, +∞, if(+∞ = -∞, -∞, (𝐴 + +∞))))) = +∞) |
| 14 | 3, 13 | sylan9eq 2792 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (𝐴 +𝑒 +∞) = +∞) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ifcif 4481 (class class class)co 7368 0cc0 11038 + caddc 11041 +∞cpnf 11175 -∞cmnf 11176 ℝ*cxr 11177 +𝑒 cxad 13036 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-mulcl 11100 ax-i2m1 11106 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-sbc 3743 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-iota 6456 df-fun 6502 df-fv 6508 df-ov 7371 df-oprab 7372 df-mpo 7373 df-pnf 11180 df-mnf 11181 df-xr 11182 df-xadd 13039 |
| This theorem is referenced by: xnn0xaddcl 13162 xaddnemnf 13163 xaddcom 13167 xnn0xadd0 13174 xnegdi 13175 xaddass 13176 xleadd1a 13180 xlt2add 13187 xsubge0 13188 xlesubadd 13190 xadddilem 13221 xrsdsreclblem 21379 isxmet2d 24283 xrge0iifhom 34114 esumpr2 34244 hasheuni 34262 carsgclctunlem2 34496 ovolsplit 46343 sge0pr 46749 sge0split 46764 sge0xadd 46790 |
| Copyright terms: Public domain | W3C validator |