Metamath Proof Explorer


Theorem sn-ltmul2d

Description: ltmul2d without ax-mulcom . (Contributed by SN, 26-Jun-2024)

Ref Expression
Hypotheses sn-ltmul2d.a ⊢ φ → A ∈ ℝ
sn-ltmul2d.b ⊢ φ → B ∈ ℝ
sn-ltmul2d.c ⊢ φ → C ∈ ℝ
sn-ltmul2d.1 ⊢ φ → 0 < C
Assertion sn-ltmul2d ⊢ φ → C ⁢ A < C ⁢ B ↔ A < B

Proof

Step Hyp Ref Expression
1 sn-ltmul2d.a ⊢ φ → A ∈ ℝ
2 sn-ltmul2d.b ⊢ φ → B ∈ ℝ
3 sn-ltmul2d.c ⊢ φ → C ∈ ℝ
4 sn-ltmul2d.1 ⊢ φ → 0 < C
5 rersubcl ⊢ B ∈ ℝ ∧ A ∈ ℝ → B - ℝ A ∈ ℝ
6 2 1 5 syl2anc ⊢ φ → B - ℝ A ∈ ℝ
7 3 6 4 mulgt0b1d ⊢ φ → 0 < B - ℝ A ↔ 0 < C ⁢ B - ℝ A
8 resubdi ⊢ C ∈ ℝ ∧ B ∈ ℝ ∧ A ∈ ℝ → C ⁢ B - ℝ A = C ⁢ B - ℝ C ⁢ A
9 3 2 1 8 syl3anc ⊢ φ → C ⁢ B - ℝ A = C ⁢ B - ℝ C ⁢ A
10 9 breq2d ⊢ φ → 0 < C ⁢ B - ℝ A ↔ 0 < C ⁢ B - ℝ C ⁢ A
11 7 10 bitr2d ⊢ φ → 0 < C ⁢ B - ℝ C ⁢ A ↔ 0 < B - ℝ A
12 3 1 remulcld ⊢ φ → C ⁢ A ∈ ℝ
13 3 2 remulcld ⊢ φ → C ⁢ B ∈ ℝ
14 reposdif ⊢ C ⁢ A ∈ ℝ ∧ C ⁢ B ∈ ℝ → C ⁢ A < C ⁢ B ↔ 0 < C ⁢ B - ℝ C ⁢ A
15 12 13 14 syl2anc ⊢ φ → C ⁢ A < C ⁢ B ↔ 0 < C ⁢ B - ℝ C ⁢ A
16 reposdif ⊢ A ∈ ℝ ∧ B ∈ ℝ → A < B ↔ 0 < B - ℝ A
17 1 2 16 syl2anc ⊢ φ → A < B ↔ 0 < B - ℝ A
18 11 15 17 3bitr4d ⊢ φ → C ⁢ A < C ⁢ B ↔ A < B