| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xmulmnf1 | Structured version Visualization version GIF version | ||
| Description: Multiplication by minus infinity on the right. (Contributed by Mario Carneiro, 20-Aug-2015.) |
| Ref | Expression |
|---|---|
| xmulmnf1 | ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (𝐴 ·e -∞) = -∞) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xnegpnf 13378 | . . 3 ⊢ -e+∞ = -∞ | |
| 2 | 1 | oveq2i 7461 | . 2 ⊢ (𝐴 ·e -e+∞) = (𝐴 ·e -∞) |
| 3 | simpl 488 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → 𝐴 ∈ ℝ*) | |
| 4 | pnfxr 11401 | . . . 4 ⊢ +∞ ∈ ℝ* | |
| 5 | xmulneg2 13439 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ +∞ ∈ ℝ*) → (𝐴 ·e -e+∞) = -e(𝐴 ·e +∞)) | |
| 6 | 3, 4, 5 | sylancl 598 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (𝐴 ·e -e+∞) = -e(𝐴 ·e +∞)) |
| 7 | xmulpnf1 13443 | . . . . 5 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (𝐴 ·e +∞) = +∞) | |
| 8 | xnegeq 13376 | . . . . 5 ⊢ ((𝐴 ·e +∞) = +∞ → -e(𝐴 ·e +∞) = -e+∞) | |
| 9 | 7, 8 | syl 18 | . . . 4 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → -e(𝐴 ·e +∞) = -e+∞) |
| 10 | 9, 1 | eqtrdi 2817 | . . 3 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → -e(𝐴 ·e +∞) = -∞) |
| 11 | 6, 10 | eqtrd 2801 | . 2 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (𝐴 ·e -e+∞) = -∞) |
| 12 | 2, 11 | eqtr3id 2815 | 1 ⊢ ((𝐴 ∈ ℝ* ∧ 0 < 𝐴) → (𝐴 ·e -∞) = -∞) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1572 ∈ wcel 2150 class class class wbr 5107 (class class class)co 7450 0cc0 11238 +∞cpnf 11378 -∞cmnf 11379 ℝ*cxr 11380 < clt 11381 -ecxne 13277 ·e cxmu 13279 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 ax-cnex 11294 ax-resscn 11295 ax-1cn 11296 ax-icn 11297 ax-addcl 11298 ax-addrcl 11299 ax-mulcl 11300 ax-mulrcl 11301 ax-mulcom 11302 ax-addass 11303 ax-mulass 11304 ax-distr 11305 ax-i2m1 11306 ax-1ne0 11307 ax-1rid 11308 ax-rnegex 11309 ax-rrecex 11310 ax-cnre 11311 ax-pre-lttri 11312 ax-pre-lttrn 11313 ax-pre-ltadd 11314 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1105 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-nel 3069 df-ral 3084 df-rex 3094 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-po 5565 df-so 5566 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-mpo 7455 df-er 8754 df-en 9011 df-dom 9012 df-sdom 9013 df-pnf 11383 df-mnf 11384 df-xr 11385 df-ltxr 11386 df-le 11387 df-sub 11581 df-neg 11582 df-xneg 13280 df-xmul 13282 |
| This theorem is used by: xmulmnf2 13446 xadddilem 13463 |
| Copyright terms: Public domain | W3C validator |