| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lemul1a | Structured version Visualization version GIF version | ||
| Description: Multiplication of both sides of 'less than or equal to' by a nonnegative number. (Contributed by NM, 21-Feb-2005.) |
| Ref | Expression |
|---|---|
| lemul1a | ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 ≤ 𝐶)) ∧ 𝐴 ≤ 𝐵) → (𝐴 · 𝐶) ≤ (𝐵 · 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0re 11144 | . . . . . . 7 ⊢ 0 ∈ ℝ | |
| 2 | leloe 11230 | . . . . . . 7 ⊢ ((0 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (0 ≤ 𝐶 ↔ (0 < 𝐶 ∨ 0 = 𝐶))) | |
| 3 | 1, 2 | mpan 696 | . . . . . 6 ⊢ (𝐶 ∈ ℝ → (0 ≤ 𝐶 ↔ (0 < 𝐶 ∨ 0 = 𝐶))) |
| 4 | 3 | pm5.32i 579 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ 0 ≤ 𝐶) ↔ (𝐶 ∈ ℝ ∧ (0 < 𝐶 ∨ 0 = 𝐶))) |
| 5 | lemul1 12005 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ (𝐴 · 𝐶) ≤ (𝐵 · 𝐶))) | |
| 6 | 5 | biimpd 230 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 → (𝐴 · 𝐶) ≤ (𝐵 · 𝐶))) |
| 7 | 6 | 3expia 1127 | . . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 ∈ ℝ ∧ 0 < 𝐶) → (𝐴 ≤ 𝐵 → (𝐴 · 𝐶) ≤ (𝐵 · 𝐶)))) |
| 8 | 7 | com12 32 | . . . . . 6 ⊢ ((𝐶 ∈ ℝ ∧ 0 < 𝐶) → ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 → (𝐴 · 𝐶) ≤ (𝐵 · 𝐶)))) |
| 9 | 1 | leidi 11682 | . . . . . . . . . 10 ⊢ 0 ≤ 0 |
| 10 | recn 11126 | . . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 11 | 10 | mul01d 11343 | . . . . . . . . . . 11 ⊢ (𝐴 ∈ ℝ → (𝐴 · 0) = 0) |
| 12 | recn 11126 | . . . . . . . . . . . 12 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
| 13 | 12 | mul01d 11343 | . . . . . . . . . . 11 ⊢ (𝐵 ∈ ℝ → (𝐵 · 0) = 0) |
| 14 | 11, 13 | breqan12d 5095 | . . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐴 · 0) ≤ (𝐵 · 0) ↔ 0 ≤ 0)) |
| 15 | 9, 14 | mpbiri 259 | . . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 · 0) ≤ (𝐵 · 0)) |
| 16 | oveq2 7371 | . . . . . . . . . 10 ⊢ (0 = 𝐶 → (𝐴 · 0) = (𝐴 · 𝐶)) | |
| 17 | oveq2 7371 | . . . . . . . . . 10 ⊢ (0 = 𝐶 → (𝐵 · 0) = (𝐵 · 𝐶)) | |
| 18 | 16, 17 | breq12d 5092 | . . . . . . . . 9 ⊢ (0 = 𝐶 → ((𝐴 · 0) ≤ (𝐵 · 0) ↔ (𝐴 · 𝐶) ≤ (𝐵 · 𝐶))) |
| 19 | 15, 18 | imbitrid 245 | . . . . . . . 8 ⊢ (0 = 𝐶 → ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 · 𝐶) ≤ (𝐵 · 𝐶))) |
| 20 | 19 | a1dd 50 | . . . . . . 7 ⊢ (0 = 𝐶 → ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 → (𝐴 · 𝐶) ≤ (𝐵 · 𝐶)))) |
| 21 | 20 | adantl 482 | . . . . . 6 ⊢ ((𝐶 ∈ ℝ ∧ 0 = 𝐶) → ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 → (𝐴 · 𝐶) ≤ (𝐵 · 𝐶)))) |
| 22 | 8, 21 | jaodan 965 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ (0 < 𝐶 ∨ 0 = 𝐶)) → ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 → (𝐴 · 𝐶) ≤ (𝐵 · 𝐶)))) |
| 23 | 4, 22 | sylbi 218 | . . . 4 ⊢ ((𝐶 ∈ ℝ ∧ 0 ≤ 𝐶) → ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 → (𝐴 · 𝐶) ≤ (𝐵 · 𝐶)))) |
| 24 | 23 | com12 32 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → ((𝐶 ∈ ℝ ∧ 0 ≤ 𝐶) → (𝐴 ≤ 𝐵 → (𝐴 · 𝐶) ≤ (𝐵 · 𝐶)))) |
| 25 | 24 | 3impia 1123 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 ≤ 𝐶)) → (𝐴 ≤ 𝐵 → (𝐴 · 𝐶) ≤ (𝐵 · 𝐶))) |
| 26 | 25 | imp 407 | 1 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 ≤ 𝐶)) ∧ 𝐴 ≤ 𝐵) → (𝐴 · 𝐶) ≤ (𝐵 · 𝐶)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∨ wo 853 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 class class class wbr 5079 (class class class)co 7363 ℝcr 11035 0cc0 11036 · cmul 11041 < clt 11177 ≤ cle 11178 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2712 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-br 5080 df-opab 5142 df-mpt 5161 df-id 5520 df-po 5533 df-so 5534 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-er 8640 df-en 8891 df-dom 8892 df-sdom 8893 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 |
| This theorem is referenced by: lemul2a 12008 ltmul12a 12009 lemul12b 12010 lt2msq1 12038 lemul1ad 12093 faclbnd4lem1 14253 facavg 14261 mulcn2 15556 o1fsum 15774 eftlub 16074 bddmulibl 25831 cxpaddlelem 26740 dchrmusum2 27482 axcontlem7 29064 nmoub3i 30869 siilem1 30947 ubthlem3 30968 bcs2 31278 cnlnadjlem2 32164 leopnmid 32234 eulerpartlemgc 34553 rrntotbnd 38210 jm2.17a 43412 |
| Copyright terms: Public domain | W3C validator |