![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ltmul2 | Structured version Visualization version GIF version |
Description: Multiplication of both sides of 'less than' by a positive number. Theorem I.19 of [Apostol] p. 20. (Contributed by NM, 13-Feb-2005.) |
Ref | Expression |
---|---|
ltmul2 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 < 𝐵 ↔ (𝐶 · 𝐴) < (𝐶 · 𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltmul1 12046 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 < 𝐵 ↔ (𝐴 · 𝐶) < (𝐵 · 𝐶))) | |
2 | recn 11182 | . . . 4 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℂ) | |
3 | recn 11182 | . . . . . . 7 ⊢ (𝐴 ∈ ℝ → 𝐴 ∈ ℂ) | |
4 | mulcom 11178 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 · 𝐶) = (𝐶 · 𝐴)) | |
5 | 3, 4 | sylan 580 | . . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ 𝐶 ∈ ℂ) → (𝐴 · 𝐶) = (𝐶 · 𝐴)) |
6 | 5 | 3adant2 1131 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℂ) → (𝐴 · 𝐶) = (𝐶 · 𝐴)) |
7 | recn 11182 | . . . . . . 7 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
8 | mulcom 11178 | . . . . . . 7 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 · 𝐶) = (𝐶 · 𝐵)) | |
9 | 7, 8 | sylan 580 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℂ) → (𝐵 · 𝐶) = (𝐶 · 𝐵)) |
10 | 9 | 3adant1 1130 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℂ) → (𝐵 · 𝐶) = (𝐶 · 𝐵)) |
11 | 6, 10 | breq12d 5154 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℂ) → ((𝐴 · 𝐶) < (𝐵 · 𝐶) ↔ (𝐶 · 𝐴) < (𝐶 · 𝐵))) |
12 | 2, 11 | syl3an3 1165 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → ((𝐴 · 𝐶) < (𝐵 · 𝐶) ↔ (𝐶 · 𝐴) < (𝐶 · 𝐵))) |
13 | 12 | 3adant3r 1181 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 · 𝐶) < (𝐵 · 𝐶) ↔ (𝐶 · 𝐴) < (𝐶 · 𝐵))) |
14 | 1, 13 | bitrd 278 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 < 𝐵 ↔ (𝐶 · 𝐴) < (𝐶 · 𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 class class class wbr 5141 (class class class)co 7393 ℂcc 11090 ℝcr 11091 0cc0 11092 · cmul 11097 < clt 11230 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-sep 5292 ax-nul 5299 ax-pow 5356 ax-pr 5420 ax-un 7708 ax-resscn 11149 ax-1cn 11150 ax-icn 11151 ax-addcl 11152 ax-addrcl 11153 ax-mulcl 11154 ax-mulrcl 11155 ax-mulcom 11156 ax-addass 11157 ax-mulass 11158 ax-distr 11159 ax-i2m1 11160 ax-1ne0 11161 ax-1rid 11162 ax-rnegex 11163 ax-rrecex 11164 ax-cnre 11165 ax-pre-lttri 11166 ax-pre-lttrn 11167 ax-pre-ltadd 11168 ax-pre-mulgt0 11169 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3774 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-nul 4319 df-if 4523 df-pw 4598 df-sn 4623 df-pr 4625 df-op 4629 df-uni 4902 df-br 5142 df-opab 5204 df-mpt 5225 df-id 5567 df-po 5581 df-so 5582 df-xp 5675 df-rel 5676 df-cnv 5677 df-co 5678 df-dm 5679 df-rn 5680 df-res 5681 df-ima 5682 df-iota 6484 df-fun 6534 df-fn 6535 df-f 6536 df-f1 6537 df-fo 6538 df-f1o 6539 df-fv 6540 df-riota 7349 df-ov 7396 df-oprab 7397 df-mpo 7398 df-er 8686 df-en 8923 df-dom 8924 df-sdom 8925 df-pnf 11232 df-mnf 11233 df-ltxr 11235 df-sub 11428 df-neg 11429 |
This theorem is referenced by: ltmul12a 12052 mulgt1 12055 ltmulgt11 12056 lt2msq1 12080 ltdiv2 12082 ltmul2i 12117 ltmul2d 13040 ef01bndlem 16109 cos01gt0 16116 sin4lt0 16120 pockthg 16821 prmreclem1 16831 prmreclem5 16835 blcvx 24243 dvcvx 25466 itgulm 25849 tangtx 25944 chtub 26642 bposlem1 26714 bposlem2 26715 bposlem7 26720 lgsdilem 26754 lgsquadlem1 26810 lgsquadlem2 26811 chebbnd1lem3 26901 chto1ub 26906 pntlemb 27027 irrapxlem1 41331 irrapxlem2 41332 irrapxlem5 41335 pellexlem2 41339 stoweidlem11 44500 stoweidlem26 44515 |
Copyright terms: Public domain | W3C validator |