![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ltdivmul2 | Structured version Visualization version GIF version |
Description: 'Less than' relationship between division and multiplication. (Contributed by NM, 24-Feb-2005.) |
Ref | Expression |
---|---|
ltdivmul2 | ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 / 𝐶) < 𝐵 ↔ 𝐴 < (𝐵 · 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltdivmul 12026 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → ((𝐴 / 𝐶) < 𝐵 ↔ 𝐴 < (𝐶 · 𝐵))) | |
2 | recn 11137 | . . . . . 6 ⊢ (𝐵 ∈ ℝ → 𝐵 ∈ ℂ) | |
3 | recn 11137 | . . . . . 6 ⊢ (𝐶 ∈ ℝ → 𝐶 ∈ ℂ) | |
4 | mulcom 11133 | . . . . . 6 ⊢ ((𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 · 𝐶) = (𝐶 · 𝐵)) | |
5 | 2, 3, 4 | syl2an 596 | . . . . 5 ⊢ ((𝐵 ∈ ℝ ∧ 𝐶 ∈ ℝ) → (𝐵 · 𝐶) = (𝐶 · 𝐵)) |
6 | 5 | adantrr 715 | . . . 4 ⊢ ((𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 · 𝐶) = (𝐶 · 𝐵)) |
7 | 6 | 3adant1 1130 | . . 3 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐵 · 𝐶) = (𝐶 · 𝐵)) |
8 | 7 | breq2d 5115 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 < (𝐵 · 𝐶) ↔ 𝐴 < (𝐶 · 𝐵))) |
9 | 1, 8 | bitr4d 281 | 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 5103 (class class class)co 7353 ℂcc 11045 ℝcr 11046 0cc0 11047 · cmul 11052 < clt 11185 / cdiv 11808 |
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 2707 ax-sep 5254 ax-nul 5261 ax-pow 5318 ax-pr 5382 ax-un 7668 ax-resscn 11104 ax-1cn 11105 ax-icn 11106 ax-addcl 11107 ax-addrcl 11108 ax-mulcl 11109 ax-mulrcl 11110 ax-mulcom 11111 ax-addass 11112 ax-mulass 11113 ax-distr 11114 ax-i2m1 11115 ax-1ne0 11116 ax-1rid 11117 ax-rnegex 11118 ax-rrecex 11119 ax-cnre 11120 ax-pre-lttri 11121 ax-pre-lttrn 11122 ax-pre-ltadd 11123 ax-pre-mulgt0 11124 |
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 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3351 df-reu 3352 df-rab 3406 df-v 3445 df-sbc 3738 df-csb 3854 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-nul 4281 df-if 4485 df-pw 4560 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4864 df-br 5104 df-opab 5166 df-mpt 5187 df-id 5529 df-po 5543 df-so 5544 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6445 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7309 df-ov 7356 df-oprab 7357 df-mpo 7358 df-er 8644 df-en 8880 df-dom 8881 df-sdom 8882 df-pnf 11187 df-mnf 11188 df-xr 11189 df-ltxr 11190 df-le 11191 df-sub 11383 df-neg 11384 df-div 11809 |
This theorem is referenced by: lemuldiv 12031 gtndiv 12576 ltdivmul2d 13001 hashdvds 16639 dyaddisjlem 24943 tangtx 25846 ang180lem2 26144 bposlem6 26621 lgsquadlem1 26712 chto1ub 26808 hgt750lem 33133 unbdqndv2lem1 34939 pellfundex 41147 stoweidlem14 44187 stoweidlem60 44233 |
Copyright terms: Public domain | W3C validator |