Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > xaddpnf2 | Structured version Visualization version 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 10697 | . . 3 ⊢ +∞ ∈ ℝ* | |
2 | xaddval 12619 | . . 3 ⊢ ((+∞ ∈ ℝ* ∧ 𝐴 ∈ ℝ*) → (+∞ +𝑒 𝐴) = if(+∞ = +∞, if(𝐴 = -∞, 0, +∞), if(+∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (+∞ + 𝐴)))))) | |
3 | 1, 2 | mpan 688 | . 2 ⊢ (𝐴 ∈ ℝ* → (+∞ +𝑒 𝐴) = if(+∞ = +∞, if(𝐴 = -∞, 0, +∞), if(+∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (+∞ + 𝐴)))))) |
4 | eqid 2823 | . . . 4 ⊢ +∞ = +∞ | |
5 | 4 | iftruei 4476 | . . 3 ⊢ if(+∞ = +∞, if(𝐴 = -∞, 0, +∞), if(+∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (+∞ + 𝐴))))) = if(𝐴 = -∞, 0, +∞) |
6 | ifnefalse 4481 | . . 3 ⊢ (𝐴 ≠ -∞ → if(𝐴 = -∞, 0, +∞) = +∞) | |
7 | 5, 6 | syl5eq 2870 | . 2 ⊢ (𝐴 ≠ -∞ → if(+∞ = +∞, if(𝐴 = -∞, 0, +∞), if(+∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (+∞ + 𝐴))))) = +∞) |
8 | 3, 7 | sylan9eq 2878 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ -∞) → (+∞ +𝑒 𝐴) = +∞) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 ifcif 4469 (class class class)co 7158 0cc0 10539 + caddc 10542 +∞cpnf 10674 -∞cmnf 10675 ℝ*cxr 10676 +𝑒 cxad 12508 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-mulcl 10601 ax-i2m1 10607 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-id 5462 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-iota 6316 df-fun 6359 df-fv 6365 df-ov 7161 df-oprab 7162 df-mpo 7163 df-pnf 10679 df-mnf 10680 df-xr 10681 df-xadd 12511 |
This theorem is referenced by: xnn0xaddcl 12631 xaddnemnf 12632 xaddcom 12636 xaddid1 12637 xnn0xadd0 12643 xnegdi 12644 xaddass 12645 xleadd1a 12649 xadddilem 12690 xadddi2 12693 hashinfxadd 13749 xrsdsreclblem 20593 isxmet2d 22939 xaddeq0 30479 xrge0adddir 30681 xrge0iifhom 31182 infrpge 41626 infleinflem1 41645 ovolsplit 42280 sge0pr 42683 sge0split 42698 sge0xaddlem1 42722 sge0xadd 42724 |
Copyright terms: Public domain | W3C validator |