Metamath Proof Explorer


Theorem lemuldiv2d

Description: 'Less than or equal to' relationship between division and multiplication. (Contributed by Mario Carneiro, 30-May-2016)

Ref Expression
Hypotheses ltmul1d.1 ( 𝜑𝐴 ∈ ℝ )
ltmul1d.2 ( 𝜑𝐵 ∈ ℝ )
ltmul1d.3 ( 𝜑𝐶 ∈ ℝ+ )
Assertion lemuldiv2d ( 𝜑 → ( ( 𝐶 · 𝐴 ) ≤ 𝐵𝐴 ≤ ( 𝐵 / 𝐶 ) ) )

Proof

Step Hyp Ref Expression
1 ltmul1d.1 ( 𝜑𝐴 ∈ ℝ )
2 ltmul1d.2 ( 𝜑𝐵 ∈ ℝ )
3 ltmul1d.3 ( 𝜑𝐶 ∈ ℝ+ )
4 3 rpregt0d ( 𝜑 → ( 𝐶 ∈ ℝ ∧ 0 < 𝐶 ) )
5 lemuldiv2 ( ( 𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ ∧ ( 𝐶 ∈ ℝ ∧ 0 < 𝐶 ) ) → ( ( 𝐶 · 𝐴 ) ≤ 𝐵𝐴 ≤ ( 𝐵 / 𝐶 ) ) )
6 1 2 4 5 syl3anc ( 𝜑 → ( ( 𝐶 · 𝐴 ) ≤ 𝐵𝐴 ≤ ( 𝐵 / 𝐶 ) ) )