Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mulle0b | Structured version Visualization version GIF version |
Description: A condition for multiplication to be nonpositive. (Contributed by Scott Fenton, 25-Jun-2013.) |
Ref | Expression |
---|---|
mulle0b | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 · 𝐵) ≤ 0 ↔ ((𝐴 ≤ 0 ∧ 0 ≤ 𝐵) ∨ (0 ≤ 𝐴 ∧ 𝐵 ≤ 0)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | remulcl 9900 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 · 𝐵) ∈ ℝ) | |
2 | 1 | le0neg1d 10478 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 · 𝐵) ≤ 0 ↔ 0 ≤ -(𝐴 · 𝐵))) |
3 | le0neg2 10416 | . . . . . 6 ⊢ (𝐵 ∈ ℝ → (0 ≤ 𝐵 ↔ -𝐵 ≤ 0)) | |
4 | 3 | anbi2d 736 | . . . . 5 ⊢ (𝐵 ∈ ℝ → ((𝐴 ≤ 0 ∧ 0 ≤ 𝐵) ↔ (𝐴 ≤ 0 ∧ -𝐵 ≤ 0))) |
5 | le0neg1 10415 | . . . . . 6 ⊢ (𝐵 ∈ ℝ → (𝐵 ≤ 0 ↔ 0 ≤ -𝐵)) | |
6 | 5 | anbi2d 736 | . . . . 5 ⊢ (𝐵 ∈ ℝ → ((0 ≤ 𝐴 ∧ 𝐵 ≤ 0) ↔ (0 ≤ 𝐴 ∧ 0 ≤ -𝐵))) |
7 | 4, 6 | orbi12d 742 | . . . 4 ⊢ (𝐵 ∈ ℝ → (((𝐴 ≤ 0 ∧ 0 ≤ 𝐵) ∨ (0 ≤ 𝐴 ∧ 𝐵 ≤ 0)) ↔ ((𝐴 ≤ 0 ∧ -𝐵 ≤ 0) ∨ (0 ≤ 𝐴 ∧ 0 ≤ -𝐵)))) |
8 | 7 | adantl 481 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (((𝐴 ≤ 0 ∧ 0 ≤ 𝐵) ∨ (0 ≤ 𝐴 ∧ 𝐵 ≤ 0)) ↔ ((𝐴 ≤ 0 ∧ -𝐵 ≤ 0) ∨ (0 ≤ 𝐴 ∧ 0 ≤ -𝐵)))) |
9 | renegcl 10223 | . . . 4 ⊢ (𝐵 ∈ ℝ → -𝐵 ∈ ℝ) | |
10 | mulge0b 10772 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ -𝐵 ∈ ℝ) → (0 ≤ (𝐴 · -𝐵) ↔ ((𝐴 ≤ 0 ∧ -𝐵 ≤ 0) ∨ (0 ≤ 𝐴 ∧ 0 ≤ -𝐵)))) | |
11 | 9, 10 | sylan2 490 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 ≤ (𝐴 · -𝐵) ↔ ((𝐴 ≤ 0 ∧ -𝐵 ≤ 0) ∨ (0 ≤ 𝐴 ∧ 0 ≤ -𝐵)))) |
12 | recn 9905 | . . . 4 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
13 | recn 9905 | . . . 4 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
14 | mulneg2 10346 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · -𝐵) = -(𝐴 · 𝐵)) | |
15 | 14 | breq2d 4595 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (0 ≤ (𝐴 · -𝐵) ↔ 0 ≤ -(𝐴 · 𝐵))) |
16 | 12, 13, 15 | syl2an 493 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 ≤ (𝐴 · -𝐵) ↔ 0 ≤ -(𝐴 · 𝐵))) |
17 | 8, 11, 16 | 3bitr2rd 296 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 ≤ -(𝐴 · 𝐵) ↔ ((𝐴 ≤ 0 ∧ 0 ≤ 𝐵) ∨ (0 ≤ 𝐴 ∧ 𝐵 ≤ 0)))) |
18 | 2, 17 | bitrd 267 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 · 𝐵) ≤ 0 ↔ ((𝐴 ≤ 0 ∧ 0 ≤ 𝐵) ∨ (0 ≤ 𝐴 ∧ 𝐵 ≤ 0)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∨ wo 382 ∧ wa 383 ∈ wcel 1977 class class class wbr 4583 (class class class)co 6549 ℂcc 9813 ℝcr 9814 0cc0 9815 · cmul 9820 ≤ cle 9954 -cneg 10146 |
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 |
This theorem is referenced by: mulsuble0b 10774 addmodlteq 12607 colinearalglem4 25589 reclt0d 38548 |
Copyright terms: Public domain | W3C validator |