Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mul2lt0rlt0 | Structured version Visualization version GIF version |
Description: If the result of a multiplication is strictly negative, then multiplicands are of different signs. (Contributed by Thierry Arnoux, 19-Sep-2018.) |
Ref | Expression |
---|---|
mul2lt0.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
mul2lt0.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
mul2lt0.3 | ⊢ (𝜑 → (𝐴 · 𝐵) < 0) |
Ref | Expression |
---|---|
mul2lt0rlt0 | ⊢ ((𝜑 ∧ 𝐵 < 0) → 0 < 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mul2lt0.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
2 | mul2lt0.2 | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
3 | 1, 2 | remulcld 9949 | . . . . 5 ⊢ (𝜑 → (𝐴 · 𝐵) ∈ ℝ) |
4 | 3 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 < 0) → (𝐴 · 𝐵) ∈ ℝ) |
5 | 0red 9920 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 < 0) → 0 ∈ ℝ) | |
6 | negelrp 11740 | . . . . . 6 ⊢ (𝐵 ∈ ℝ → (-𝐵 ∈ ℝ+ ↔ 𝐵 < 0)) | |
7 | 2, 6 | syl 17 | . . . . 5 ⊢ (𝜑 → (-𝐵 ∈ ℝ+ ↔ 𝐵 < 0)) |
8 | 7 | biimpar 501 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 < 0) → -𝐵 ∈ ℝ+) |
9 | mul2lt0.3 | . . . . 5 ⊢ (𝜑 → (𝐴 · 𝐵) < 0) | |
10 | 9 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 < 0) → (𝐴 · 𝐵) < 0) |
11 | 4, 5, 8, 10 | ltdiv1dd 11805 | . . 3 ⊢ ((𝜑 ∧ 𝐵 < 0) → ((𝐴 · 𝐵) / -𝐵) < (0 / -𝐵)) |
12 | 1 | recnd 9947 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
13 | 12 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 0) → 𝐴 ∈ ℂ) |
14 | 2 | recnd 9947 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
15 | 14 | adantr 480 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 0) → 𝐵 ∈ ℂ) |
16 | 13, 15 | mulcld 9939 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 < 0) → (𝐴 · 𝐵) ∈ ℂ) |
17 | simpr 476 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 < 0) → 𝐵 < 0) | |
18 | 17 | lt0ne0d 10472 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 < 0) → 𝐵 ≠ 0) |
19 | 16, 15, 18 | divneg2d 10694 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 < 0) → -((𝐴 · 𝐵) / 𝐵) = ((𝐴 · 𝐵) / -𝐵)) |
20 | 13, 15, 18 | divcan4d 10686 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 < 0) → ((𝐴 · 𝐵) / 𝐵) = 𝐴) |
21 | 20 | negeqd 10154 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 < 0) → -((𝐴 · 𝐵) / 𝐵) = -𝐴) |
22 | 19, 21 | eqtr3d 2646 | . . 3 ⊢ ((𝜑 ∧ 𝐵 < 0) → ((𝐴 · 𝐵) / -𝐵) = -𝐴) |
23 | 15 | negcld 10258 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 < 0) → -𝐵 ∈ ℂ) |
24 | 15, 18 | negne0d 10269 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 < 0) → -𝐵 ≠ 0) |
25 | 23, 24 | div0d 10679 | . . 3 ⊢ ((𝜑 ∧ 𝐵 < 0) → (0 / -𝐵) = 0) |
26 | 11, 22, 25 | 3brtr3d 4614 | . 2 ⊢ ((𝜑 ∧ 𝐵 < 0) → -𝐴 < 0) |
27 | 1 | adantr 480 | . . 3 ⊢ ((𝜑 ∧ 𝐵 < 0) → 𝐴 ∈ ℝ) |
28 | 27 | lt0neg2d 10477 | . 2 ⊢ ((𝜑 ∧ 𝐵 < 0) → (0 < 𝐴 ↔ -𝐴 < 0)) |
29 | 26, 28 | mpbird 246 | 1 ⊢ ((𝜑 ∧ 𝐵 < 0) → 0 < 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 ∈ wcel 1977 class class class wbr 4583 (class class class)co 6549 ℂcc 9813 ℝcr 9814 0cc0 9815 · cmul 9820 < clt 9953 -cneg 10146 / cdiv 10563 ℝ+crp 11708 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-po 4959 df-so 4960 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-rp 11709 |
This theorem is referenced by: mul2lt0llt0 11810 mul2lt0bi 11812 sgnmul 29931 signsply0 29954 |
Copyright terms: Public domain | W3C validator |