Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > lemul1d | Structured version Visualization version GIF version |
Description: Multiplication of both sides of 'less than or equal to' by a positive number. (Contributed by Mario Carneiro, 28-May-2016.) |
Ref | Expression |
---|---|
ltmul1d.1 | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
ltmul1d.2 | ⊢ (𝜑 → 𝐵 ∈ ℝ) |
ltmul1d.3 | ⊢ (𝜑 → 𝐶 ∈ ℝ+) |
Ref | Expression |
---|---|
lemul1d | ⊢ (𝜑 → (𝐴 ≤ 𝐵 ↔ (𝐴 · 𝐶) ≤ (𝐵 · 𝐶))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ltmul1d.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
2 | ltmul1d.2 | . 2 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
3 | ltmul1d.3 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ+) | |
4 | 3 | rpregt0d 12760 | . 2 ⊢ (𝜑 → (𝐶 ∈ ℝ ∧ 0 < 𝐶)) |
5 | lemul1 11810 | . 2 ⊢ ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ (𝐶 ∈ ℝ ∧ 0 < 𝐶)) → (𝐴 ≤ 𝐵 ↔ (𝐴 · 𝐶) ≤ (𝐵 · 𝐶))) | |
6 | 1, 2, 4, 5 | syl3anc 1369 | 1 ⊢ (𝜑 → (𝐴 ≤ 𝐵 ↔ (𝐴 · 𝐶) ≤ (𝐵 · 𝐶))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∈ wcel 2109 class class class wbr 5078 (class class class)co 7268 ℝcr 10854 0cc0 10855 · cmul 10860 < clt 10993 ≤ cle 10994 ℝ+crp 12712 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1801 ax-4 1815 ax-5 1916 ax-6 1974 ax-7 2014 ax-8 2111 ax-9 2119 ax-10 2140 ax-11 2157 ax-12 2174 ax-ext 2710 ax-sep 5226 ax-nul 5233 ax-pow 5291 ax-pr 5355 ax-un 7579 ax-resscn 10912 ax-1cn 10913 ax-icn 10914 ax-addcl 10915 ax-addrcl 10916 ax-mulcl 10917 ax-mulrcl 10918 ax-mulcom 10919 ax-addass 10920 ax-mulass 10921 ax-distr 10922 ax-i2m1 10923 ax-1ne0 10924 ax-1rid 10925 ax-rnegex 10926 ax-rrecex 10927 ax-cnre 10928 ax-pre-lttri 10929 ax-pre-lttrn 10930 ax-pre-ltadd 10931 ax-pre-mulgt0 10932 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1544 df-fal 1554 df-ex 1786 df-nf 1790 df-sb 2071 df-mo 2541 df-eu 2570 df-clab 2717 df-cleq 2731 df-clel 2817 df-nfc 2890 df-ne 2945 df-nel 3051 df-ral 3070 df-rex 3071 df-reu 3072 df-rab 3074 df-v 3432 df-sbc 3720 df-csb 3837 df-dif 3894 df-un 3896 df-in 3898 df-ss 3908 df-nul 4262 df-if 4465 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4845 df-br 5079 df-opab 5141 df-mpt 5162 df-id 5488 df-po 5502 df-so 5503 df-xp 5594 df-rel 5595 df-cnv 5596 df-co 5597 df-dm 5598 df-rn 5599 df-res 5600 df-ima 5601 df-iota 6388 df-fun 6432 df-fn 6433 df-f 6434 df-f1 6435 df-fo 6436 df-f1o 6437 df-fv 6438 df-riota 7225 df-ov 7271 df-oprab 7272 df-mpo 7273 df-er 8472 df-en 8708 df-dom 8709 df-sdom 8710 df-pnf 10995 df-mnf 10996 df-xr 10997 df-ltxr 10998 df-le 10999 df-sub 11190 df-neg 11191 df-rp 12713 |
This theorem is referenced by: sqrlem7 14941 reccn2 15287 isprm5 16393 nrginvrcnlem 23836 nmoid 23887 logcnlem4 25781 logfaclbnd 26351 bposlem6 26418 chebbnd1lem1 26598 chebbnd1lem3 26600 rplogsumlem1 26613 dchrisum0lem1 26645 chpdifbndlem1 26682 pntibndlem2 26720 pntlemo 26736 ostth2lem3 26764 hgt750leme 32617 itg2addnclem3 35809 lcmineqlem21 40037 3lexlogpow5ineq2 40043 aks4d1p1p7 40062 irrapxlem5 40628 stirlinglem10 43578 fourierdlem4 43606 fourierdlem7 43609 fourierdlem42 43644 |
Copyright terms: Public domain | W3C validator |