Metamath Proof Explorer


Theorem lediv1d

Description: Division of both sides of a less than or equal to relation by a positive number. (Contributed by Mario Carneiro, 28-May-2016)

Ref Expression
Hypotheses ltmul1d.1 ⊢ φ → A ∈ ℝ
ltmul1d.2 ⊢ φ → B ∈ ℝ
ltmul1d.3 ⊢ φ → C ∈ ℝ +
Assertion lediv1d ⊢ φ → A ≤ B ↔ A C ≤ B C

Proof

Step Hyp Ref Expression
1 ltmul1d.1 ⊢ φ → A ∈ ℝ
2 ltmul1d.2 ⊢ φ → B ∈ ℝ
3 ltmul1d.3 ⊢ φ → C ∈ ℝ +
4 3 rpregt0d ⊢ φ → C ∈ ℝ ∧ 0 < C
5 lediv1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C → A ≤ B ↔ A C ≤ B C
6 1 2 4 5 syl3anc ⊢ φ → A ≤ B ↔ A C ≤ B C