| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lemul1 | Structured version Visualization version GIF version | ||
| Description: Multiplication of both sides of 'less than or equal to' by a positive number. (Contributed by NM, 21-Feb-2005.) |
| Ref | Expression |
|---|---|
| lemul1 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ (𝐴 · 𝐶) ≤ (𝐵 · 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ltmul1 12080 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 < 𝐵 ↔ (𝐴 · 𝐶) < (𝐵 · 𝐶))) | |
| 2 | recn 11205 | . . . . 5 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
| 3 | recn 11205 | . . . . 5 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
| 4 | recn 11205 | . . . . . . 7 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℂ) | |
| 5 | 4 | adantr 486 | . . . . . 6 ⊢ ((𝐶 ∈ ℝ ∧ 0 < 𝐶) → 𝐶 ∈ ℂ) |
| 6 | gt0ne0 11694 | . . . . . 6 ⊢ ((𝐶 ∈ ℝ ∧ 0 < 𝐶) → 𝐶 ≠ 0) | |
| 7 | 5, 6 | jca 521 | . . . . 5 ⊢ ((𝐶 ∈ ℝ ∧ 0 < 𝐶) → (𝐶 ∈ ℂ ∧ 𝐶 ≠ 0)) |
| 8 | mulcan2 11867 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ (𝐶 ∈ ℂ ∧ 𝐶 ≠ 0)) → ((𝐴 · 𝐶) = (𝐵 · 𝐶) ↔ 𝐴 = 𝐵)) | |
| 9 | 2, 3, 7, 8 | syl3an 1178 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 · 𝐶) = (𝐵 · 𝐶) ↔ 𝐴 = 𝐵)) |
| 10 | 9 | bicomd 226 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 = 𝐵 ↔ (𝐴 · 𝐶) = (𝐵 · 𝐶))) |
| 11 | 1, 10 | orbi12d 932 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 < 𝐵 ∨ 𝐴 = 𝐵) ↔ ((𝐴 · 𝐶) < (𝐵 · 𝐶) ∨ (𝐴 · 𝐶) = (𝐵 · 𝐶)))) |
| 12 | leloe 11311 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 ≤ 𝐵 ↔ (𝐴 < 𝐵 ∨ 𝐴 = 𝐵))) | |
| 13 | 12 | 3adant3 1150 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ (𝐴 < 𝐵 ∨ 𝐴 = 𝐵))) |
| 14 | remulcl 11200 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 · 𝐶) ∈ ℝ) | |
| 15 | 14 | 3adant2 1149 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐴 · 𝐶) ∈ ℝ) |
| 16 | remulcl 11200 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 · 𝐶) ∈ ℝ) | |
| 17 | 16 | 3adant1 1148 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 · 𝐶) ∈ ℝ) |
| 18 | 15, 17 | leloed 11368 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 · 𝐶) ≤ (𝐵 · 𝐶) ↔ ((𝐴 · 𝐶) < (𝐵 · 𝐶) ∨ (𝐴 · 𝐶) = (𝐵 · 𝐶)))) |
| 19 | 18 | 3adant3r 1200 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 · 𝐶) ≤ (𝐵 · 𝐶) ↔ ((𝐴 · 𝐶) < (𝐵 · 𝐶) ∨ (𝐴 · 𝐶) = (𝐵 · 𝐶)))) |
| 20 | 11, 13, 19 | 3bitr4d 314 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ (𝐴 · 𝐶) ≤ (𝐵 · 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ≠ wne 2960 class class class wbr 5111 (class class class)co 7419 ℂcc 11113 ℝcr 11114 0cc0 11115 · cmul 11120 < clt 11258 ≤ cle 11259 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-resscn 11172 ax-1cn 11173 ax-icn 11174 ax-addcl 11175 ax-addrcl 11176 ax-mulcl 11177 ax-mulrcl 11178 ax-mulcom 11179 ax-addass 11180 ax-mulass 11181 ax-distr 11182 ax-i2m1 11183 ax-1ne0 11184 ax-1rid 11185 ax-rnegex 11186 ax-rrecex 11187 ax-cnre 11188 ax-pre-lttri 11189 ax-pre-lttrn 11190 ax-pre-ltadd 11191 ax-pre-mulgt0 11192 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-po 5571 df-so 5572 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-er 8700 df-en 8950 df-dom 8951 df-sdom 8952 df-pnf 11260 df-mnf 11261 df-xr 11262 df-ltxr 11263 df-le 11264 df-sub 11458 df-neg 11459 |
| This theorem is used by: lemul2 12083 lemul1a 12084 lediv23 12122 lemul1i 12152 ledivp1i 12155 div4p1lem1div2 12514 lemul1d 13119 xlemul1a 13330 iccdil 13533 expgt1 14154 sqlecan 14263 facubnd 14354 01sqrexlem2 15318 01sqrexlem6 15322 eirrlem 16282 mbfi1fseqlem3 25927 mbfi1fseqlem4 25928 mbfi1fseqlem5 25929 itg2monolem3 25962 atans2 27147 log2tlbnd 27161 fsumfldivdiaglem 27404 chtublem 27426 bposlem2 27500 bposlem5 27503 gausslemma2dlem2 27582 2lgslem1a1 27604 selberglem2 27761 pntpbnd1a 27800 pntpbnd2 27802 ostth2lem3 27850 htthlem 31340 cnlnadjlem7 32496 bfplem1 38531 jm2.24nn 43744 jm3.1lem2 43803 stoweidlem14 46786 stoweidlem26 46798 stoweidlem34 46806 fmtno4prmfac 48382 |
| Copyright terms: Public domain | W3C validator |