Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mulsuble0b | Structured version Visualization version GIF version |
Description: A condition for multiplication of subtraction to be nonpositive. (Contributed by Scott Fenton, 25-Jun-2013.) |
Ref | Expression |
---|---|
mulsuble0b | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (((𝐴 − 𝐵) · (𝐶 − 𝐵)) ≤ 0 ↔ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) ∨ (𝐶 ≤ 𝐵 ∧ 𝐵 ≤ 𝐴)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | resubcl 10938 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 − 𝐵) ∈ ℝ) | |
2 | 1 | 3adant3 1124 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 − 𝐵) ∈ ℝ) |
3 | resubcl 10938 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐶 − 𝐵) ∈ ℝ) | |
4 | 3 | ancoms 459 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 − 𝐵) ∈ ℝ) |
5 | 4 | 3adant1 1122 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐶 − 𝐵) ∈ ℝ) |
6 | mulle0b 11499 | . . 3 ⊢ (((𝐴 − 𝐵) ∈ ℝ ∧ (𝐶 − 𝐵) ∈ ℝ) → (((𝐴 − 𝐵) · (𝐶 − 𝐵)) ≤ 0 ↔ (((𝐴 − 𝐵) ≤ 0 ∧ 0 ≤ (𝐶 − 𝐵)) ∨ (0 ≤ (𝐴 − 𝐵) ∧ (𝐶 − 𝐵) ≤ 0)))) | |
7 | 2, 5, 6 | syl2anc 584 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (((𝐴 − 𝐵) · (𝐶 − 𝐵)) ≤ 0 ↔ (((𝐴 − 𝐵) ≤ 0 ∧ 0 ≤ (𝐶 − 𝐵)) ∨ (0 ≤ (𝐴 − 𝐵) ∧ (𝐶 − 𝐵) ≤ 0)))) |
8 | suble0 11142 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 − 𝐵) ≤ 0 ↔ 𝐴 ≤ 𝐵)) | |
9 | 8 | 3adant3 1124 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 − 𝐵) ≤ 0 ↔ 𝐴 ≤ 𝐵)) |
10 | subge0 11141 | . . . . . 6 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 ≤ (𝐶 − 𝐵) ↔ 𝐵 ≤ 𝐶)) | |
11 | 10 | ancoms 459 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (0 ≤ (𝐶 − 𝐵) ↔ 𝐵 ≤ 𝐶)) |
12 | 11 | 3adant1 1122 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (0 ≤ (𝐶 − 𝐵) ↔ 𝐵 ≤ 𝐶)) |
13 | 9, 12 | anbi12d 630 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (((𝐴 − 𝐵) ≤ 0 ∧ 0 ≤ (𝐶 − 𝐵)) ↔ (𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶))) |
14 | subge0 11141 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (0 ≤ (𝐴 − 𝐵) ↔ 𝐵 ≤ 𝐴)) | |
15 | 14 | 3adant3 1124 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (0 ≤ (𝐴 − 𝐵) ↔ 𝐵 ≤ 𝐴)) |
16 | suble0 11142 | . . . . . . 7 ⊢ ((𝐶 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 − 𝐵) ≤ 0 ↔ 𝐶 ≤ 𝐵)) | |
17 | 16 | ancoms 459 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 − 𝐵) ≤ 0 ↔ 𝐶 ≤ 𝐵)) |
18 | 17 | 3adant1 1122 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐶 − 𝐵) ≤ 0 ↔ 𝐶 ≤ 𝐵)) |
19 | 15, 18 | anbi12d 630 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((0 ≤ (𝐴 − 𝐵) ∧ (𝐶 − 𝐵) ≤ 0) ↔ (𝐵 ≤ 𝐴 ∧ 𝐶 ≤ 𝐵))) |
20 | 19 | biancomd 464 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((0 ≤ (𝐴 − 𝐵) ∧ (𝐶 − 𝐵) ≤ 0) ↔ (𝐶 ≤ 𝐵 ∧ 𝐵 ≤ 𝐴))) |
21 | 13, 20 | orbi12d 912 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((((𝐴 − 𝐵) ≤ 0 ∧ 0 ≤ (𝐶 − 𝐵)) ∨ (0 ≤ (𝐴 − 𝐵) ∧ (𝐶 − 𝐵) ≤ 0)) ↔ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) ∨ (𝐶 ≤ 𝐵 ∧ 𝐵 ≤ 𝐴)))) |
22 | 7, 21 | bitrd 280 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (((𝐴 − 𝐵) · (𝐶 − 𝐵)) ≤ 0 ↔ ((𝐴 ≤ 𝐵 ∧ 𝐵 ≤ 𝐶) ∨ (𝐶 ≤ 𝐵 ∧ 𝐵 ≤ 𝐴)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∨ wo 841 ∧ w3a 1079 ∈ wcel 2105 class class class wbr 5057 (class class class)co 7145 ℝcr 10524 0cc0 10525 · cmul 10530 ≤ cle 10664 − cmin 10858 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-po 5467 df-so 5468 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-er 8278 df-en 8498 df-dom 8499 df-sdom 8500 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 |
This theorem is referenced by: brbtwn2 26618 |
Copyright terms: Public domain | W3C validator |