|   | Metamath Proof Explorer | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > ltmul1 | 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.) (Revised by Mario Carneiro, 27-May-2016.) | 
| Ref | Expression | 
|---|---|
| ltmul1 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 < 𝐵 ↔ (𝐴 · 𝐶) < (𝐵 · 𝐶))) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | ltmul1a 12117 | . . 3 ⊢ (((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) ∧ 𝐴 < 𝐵) → (𝐴 · 𝐶) < (𝐵 · 𝐶)) | |
| 2 | 1 | ex 412 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 < 𝐵 → (𝐴 · 𝐶) < (𝐵 · 𝐶))) | 
| 3 | oveq1 7439 | . . . . . 6 ⊢ (𝐴 = 𝐵 → (𝐴 · 𝐶) = (𝐵 · 𝐶)) | |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 = 𝐵 → (𝐴 · 𝐶) = (𝐵 · 𝐶))) | 
| 5 | ltmul1a 12117 | . . . . . . 7 ⊢ (((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) ∧ 𝐵 < 𝐴) → (𝐵 · 𝐶) < (𝐴 · 𝐶)) | |
| 6 | 5 | ex 412 | . . . . . 6 ⊢ ((𝐵 ∈ ℝ ∧ 𝐴 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 < 𝐴 → (𝐵 · 𝐶) < (𝐴 · 𝐶))) | 
| 7 | 6 | 3com12 1123 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 < 𝐴 → (𝐵 · 𝐶) < (𝐴 · 𝐶))) | 
| 8 | 4, 7 | orim12d 966 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 = 𝐵 ∨ 𝐵 < 𝐴) → ((𝐴 · 𝐶) = (𝐵 · 𝐶) ∨ (𝐵 · 𝐶) < (𝐴 · 𝐶)))) | 
| 9 | 8 | con3d 152 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (¬ ((𝐴 · 𝐶) = (𝐵 · 𝐶) ∨ (𝐵 · 𝐶) < (𝐴 · 𝐶)) → ¬ (𝐴 = 𝐵 ∨ 𝐵 < 𝐴))) | 
| 10 | simp1 1136 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 𝐴 ∈ ℝ) | |
| 11 | simp3l 1201 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 𝐶 ∈ ℝ) | |
| 12 | 10, 11 | remulcld 11292 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 · 𝐶) ∈ ℝ) | 
| 13 | simp2 1137 | . . . . 5 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → 𝐵 ∈ ℝ) | |
| 14 | 13, 11 | remulcld 11292 | . . . 4 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 · 𝐶) ∈ ℝ) | 
| 15 | 12, 14 | lttrid 11400 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 · 𝐶) < (𝐵 · 𝐶) ↔ ¬ ((𝐴 · 𝐶) = (𝐵 · 𝐶) ∨ (𝐵 · 𝐶) < (𝐴 · 𝐶)))) | 
| 16 | 10, 13 | lttrid 11400 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 < 𝐵 ↔ ¬ (𝐴 = 𝐵 ∨ 𝐵 < 𝐴))) | 
| 17 | 9, 15, 16 | 3imtr4d 294 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 · 𝐶) < (𝐵 · 𝐶) → 𝐴 < 𝐵)) | 
| 18 | 2, 17 | impbid 212 | 1 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 < 𝐵 ↔ (𝐴 · 𝐶) < (𝐵 · 𝐶))) | 
| Colors of variables: wff setvar class | 
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1539 ∈ wcel 2107 class class class wbr 5142 (class class class)co 7432 ℝcr 11155 0cc0 11156 · cmul 11161 < clt 11296 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756 ax-resscn 11213 ax-1cn 11214 ax-icn 11215 ax-addcl 11216 ax-addrcl 11217 ax-mulcl 11218 ax-mulrcl 11219 ax-mulcom 11220 ax-addass 11221 ax-mulass 11222 ax-distr 11223 ax-i2m1 11224 ax-1ne0 11225 ax-1rid 11226 ax-rnegex 11227 ax-rrecex 11228 ax-cnre 11229 ax-pre-lttri 11230 ax-pre-lttrn 11231 ax-pre-ltadd 11232 ax-pre-mulgt0 11233 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-br 5143 df-opab 5205 df-mpt 5225 df-id 5577 df-po 5591 df-so 5592 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 df-fo 6566 df-f1o 6567 df-fv 6568 df-riota 7389 df-ov 7435 df-oprab 7436 df-mpo 7437 df-er 8746 df-en 8987 df-dom 8988 df-sdom 8989 df-pnf 11298 df-mnf 11299 df-ltxr 11301 df-sub 11495 df-neg 11496 | 
| This theorem is referenced by: ltmul2 12119 lemul1 12120 ltdiv1 12133 ltdiv23 12160 recp1lt1 12167 ltmul1i 12187 ltdivp1i 12195 ltmul1d 13119 expmulnbnd 14275 discr1 14279 mertenslem1 15921 qnumgt0 16788 4sqlem12 16995 pgpfaclem2 20103 mbfi1fseqlem4 25754 itg2monolem1 25786 dgrcolem2 26315 tangtx 26548 ftalem1 27117 basellem4 27128 lgsquadlem1 27425 lgsquadlem2 27426 pntpbnd1 27631 ostth2lem1 27663 nn0prpwlem 36324 pellexlem2 42846 stoweidlem34 46054 stoweidlem59 46079 | 
| Copyright terms: Public domain | W3C validator |