![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > xaddmnf2 | Structured version Visualization version GIF version |
Description: Addition of negative infinity on the left. (Contributed by Mario Carneiro, 20-Aug-2015.) |
Ref | Expression |
---|---|
xaddmnf2 | ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) → (-∞ +𝑒 𝐴) = -∞) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mnfxr 11347 | . . 3 ⊢ -∞ ∈ ℝ* | |
2 | xaddval 13285 | . . 3 ⊢ ((-∞ ∈ ℝ* ∧ 𝐴 ∈ ℝ*) → (-∞ +𝑒 𝐴) = if(-∞ = +∞, if(𝐴 = -∞, 0, +∞), if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴)))))) | |
3 | 1, 2 | mpan 689 | . 2 ⊢ (𝐴 ∈ ℝ* → (-∞ +𝑒 𝐴) = if(-∞ = +∞, if(𝐴 = -∞, 0, +∞), if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴)))))) |
4 | mnfnepnf 11346 | . . . . 5 ⊢ -∞ ≠ +∞ | |
5 | ifnefalse 4560 | . . . . 5 ⊢ (-∞ ≠ +∞ → if(-∞ = +∞, if(𝐴 = -∞, 0, +∞), if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴))))) = if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴))))) | |
6 | 4, 5 | ax-mp 5 | . . . 4 ⊢ if(-∞ = +∞, if(𝐴 = -∞, 0, +∞), if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴))))) = if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴)))) |
7 | eqid 2740 | . . . . 5 ⊢ -∞ = -∞ | |
8 | 7 | iftruei 4555 | . . . 4 ⊢ if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴)))) = if(𝐴 = +∞, 0, -∞) |
9 | 6, 8 | eqtri 2768 | . . 3 ⊢ if(-∞ = +∞, if(𝐴 = -∞, 0, +∞), if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴))))) = if(𝐴 = +∞, 0, -∞) |
10 | ifnefalse 4560 | . . 3 ⊢ (𝐴 ≠ +∞ → if(𝐴 = +∞, 0, -∞) = -∞) | |
11 | 9, 10 | eqtrid 2792 | . 2 ⊢ (𝐴 ≠ +∞ → if(-∞ = +∞, if(𝐴 = -∞, 0, +∞), if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴))))) = -∞) |
12 | 3, 11 | sylan9eq 2800 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) → (-∞ +𝑒 𝐴) = -∞) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 ifcif 4548 (class class class)co 7448 0cc0 11184 + caddc 11187 +∞cpnf 11321 -∞cmnf 11322 ℝ*cxr 11323 +𝑒 cxad 13173 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-mulcl 11246 ax-i2m1 11252 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-sbc 3805 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-iota 6525 df-fun 6575 df-fv 6581 df-ov 7451 df-oprab 7452 df-mpo 7453 df-pnf 11326 df-mnf 11327 df-xr 11328 df-xadd 13176 |
This theorem is referenced by: xaddnepnf 13299 xaddcom 13302 xaddrid 13303 xnegdi 13310 xpncan 13313 xleadd1a 13315 xlt2add 13322 xadddilem 13356 xadddi2 13359 xrsnsgrp 21443 xaddeq0 32760 supxrgelem 45252 supxrge 45253 xrlexaddrp 45267 infleinflem2 45286 |
Copyright terms: Public domain | W3C validator |