Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > xaddmnf2 | 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 7917 | . . 3 ⊢ -∞ ∈ ℝ* | |
2 | xaddval 9731 | . . 3 ⊢ ((-∞ ∈ ℝ* ∧ 𝐴 ∈ ℝ*) → (-∞ +𝑒 𝐴) = if(-∞ = +∞, if(𝐴 = -∞, 0, +∞), if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴)))))) | |
3 | 1, 2 | mpan 421 | . 2 ⊢ (𝐴 ∈ ℝ* → (-∞ +𝑒 𝐴) = if(-∞ = +∞, if(𝐴 = -∞, 0, +∞), if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴)))))) |
4 | mnfnepnf 7916 | . . . . 5 ⊢ -∞ ≠ +∞ | |
5 | ifnefalse 3516 | . . . . 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 2157 | . . . . 5 ⊢ -∞ = -∞ | |
8 | 7 | iftruei 3511 | . . . 4 ⊢ if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴)))) = if(𝐴 = +∞, 0, -∞) |
9 | 6, 8 | eqtri 2178 | . . 3 ⊢ if(-∞ = +∞, if(𝐴 = -∞, 0, +∞), if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴))))) = if(𝐴 = +∞, 0, -∞) |
10 | ifnefalse 3516 | . . 3 ⊢ (𝐴 ≠ +∞ → if(𝐴 = +∞, 0, -∞) = -∞) | |
11 | 9, 10 | syl5eq 2202 | . 2 ⊢ (𝐴 ≠ +∞ → if(-∞ = +∞, if(𝐴 = -∞, 0, +∞), if(-∞ = -∞, if(𝐴 = +∞, 0, -∞), if(𝐴 = +∞, +∞, if(𝐴 = -∞, -∞, (-∞ + 𝐴))))) = -∞) |
12 | 3, 11 | sylan9eq 2210 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐴 ≠ +∞) → (-∞ +𝑒 𝐴) = -∞) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1335 ∈ wcel 2128 ≠ wne 2327 ifcif 3505 (class class class)co 5818 0cc0 7715 + caddc 7718 +∞cpnf 7892 -∞cmnf 7893 ℝ*cxr 7894 +𝑒 cxad 9659 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-13 2130 ax-14 2131 ax-ext 2139 ax-sep 4082 ax-pow 4134 ax-pr 4168 ax-un 4392 ax-setind 4494 ax-cnex 7806 ax-resscn 7807 ax-1re 7809 ax-addrcl 7812 ax-rnegex 7824 |
This theorem depends on definitions: df-bi 116 df-dc 821 df-3or 964 df-3an 965 df-tru 1338 df-fal 1341 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ne 2328 df-nel 2423 df-ral 2440 df-rex 2441 df-rab 2444 df-v 2714 df-sbc 2938 df-dif 3104 df-un 3106 df-in 3108 df-ss 3115 df-if 3506 df-pw 3545 df-sn 3566 df-pr 3567 df-op 3569 df-uni 3773 df-br 3966 df-opab 4026 df-id 4252 df-xp 4589 df-rel 4590 df-cnv 4591 df-co 4592 df-dm 4593 df-iota 5132 df-fun 5169 df-fv 5175 df-ov 5821 df-oprab 5822 df-mpo 5823 df-pnf 7897 df-mnf 7898 df-xr 7899 df-xadd 9662 |
This theorem is referenced by: xaddnepnf 9744 xaddcom 9747 xaddid1 9748 xnegdi 9754 xpncan 9757 xleadd1a 9759 xltadd1 9762 xlt2add 9766 xposdif 9768 xleaddadd 9773 xrmaxadd 11140 |
Copyright terms: Public domain | W3C validator |