| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > xaddpnf2 | GIF version | ||
| Description: Addition of positive infinity on the left. (Contributed by Mario Carneiro, 20-Aug-2015.) |
| Ref | Expression |
|---|---|
| xaddpnf2 | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (+∞ +𝑒 𝐴) = +∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pnfxr 8187 | . . 3 ⊢ +∞ ∈ ℝ* | |
| 2 | xaddval 10029 | . . 3 ⊢ ((+∞ ∈ ℝ* ∧ 𝐴 ∈ ℝ*) → (+∞ +𝑒 𝐴) = if(+∞ = +∞, if(𝐴 = -∞, 0, +∞), if(+∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (+∞ + 𝐴)))))) | |
| 3 | 1, 2 | mpan 424 | . 2 ⊢ (𝐴 ∈ ℝ* → (+∞ +𝑒 𝐴) = if(+∞ = +∞, if(𝐴 = -∞, 0, +∞), if(+∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (+∞ + 𝐴)))))) |
| 4 | eqid 2229 | . . . 4 ⊢ +∞ = +∞ | |
| 5 | 4 | iftruei 3608 | . . 3 ⊢ if(+∞ = +∞, if(𝐴 = -∞, 0, +∞), if(+∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (+∞ + 𝐴))))) = if(𝐴 = -∞, 0, +∞) |
| 6 | ifnefalse 3613 | . . 3 ⊢ (𝐴 ≠ -∞ → if(𝐴 = -∞, 0, +∞) = +∞) | |
| 7 | 5, 6 | eqtrid 2274 | . 2 ⊢ (𝐴 ≠ -∞ → if(+∞ = +∞, if(𝐴 = -∞, 0, +∞), if(+∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (+∞ + 𝐴))))) = +∞) |
| 8 | 3, 7 | sylan9eq 2282 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (+∞ +𝑒 𝐴) = +∞) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 ≠ wne 2400 ifcif 3602 (class class class)co 5994 0cc0 7987 + caddc 7990 +∞cpnf 8166 -∞cmnf 8167 ℝ*cxr 8168 +𝑒 cxad 9954 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 ax-un 4521 ax-setind 4626 ax-cnex 8078 ax-resscn 8079 ax-1re 8081 ax-addrcl 8084 ax-rnegex 8096 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2801 df-sbc 3029 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-if 3603 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-br 4083 df-opab 4145 df-id 4381 df-xp 4722 df-rel 4723 df-cnv 4724 df-co 4725 df-dm 4726 df-iota 5274 df-fun 5316 df-fv 5322 df-ov 5997 df-oprab 5998 df-mpo 5999 df-pnf 8171 df-mnf 8172 df-xr 8173 df-xadd 9957 |
| This theorem is referenced by: xaddnemnf 10041 xaddcom 10045 xaddid1 10046 xnn0xadd0 10051 xnegdi 10052 xaddass 10053 xleadd1a 10057 xltadd1 10060 xposdif 10066 xleaddadd 10071 xrmaxadd 11758 xrbdtri 11773 isxmet2d 15007 |
| Copyright terms: Public domain | W3C validator |