Metamath Proof Explorer


Theorem ltmul1a

Description: Lemma for ltmul1 . Multiplication of both sides of 'less than' by a positive number. Theorem I.19 of Apostol p. 20. (Contributed by NM, 15-May-1999) (Revised by Mario Carneiro, 27-May-2016)

Ref Expression
Assertion ltmul1a ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → A ⁢ C < B ⁢ C

Proof

Step Hyp Ref Expression
1 simpl2 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → B ∈ ℝ
2 simpl1 ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → A ∈ ℝ
3 1 2 resubcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → B − A ∈ ℝ
4 simpl3l ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → C ∈ ℝ
5 simpr ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → A < B
6 2 1 posdifd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → A < B ↔ 0 < B − A
7 5 6 mpbid ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → 0 < B − A
8 simpl3r ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → 0 < C
9 3 4 7 8 mulgt0d ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → 0 < B − A ⁢ C
10 1 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → B ∈ ℂ
11 2 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → A ∈ ℂ
12 4 recnd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → C ∈ ℂ
13 10 11 12 subdird ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → B − A ⁢ C = B ⁢ C − A ⁢ C
14 9 13 breqtrd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → 0 < B ⁢ C − A ⁢ C
15 2 4 remulcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → A ⁢ C ∈ ℝ
16 1 4 remulcld ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → B ⁢ C ∈ ℝ
17 15 16 posdifd ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → A ⁢ C < B ⁢ C ↔ 0 < B ⁢ C − A ⁢ C
18 14 17 mpbird ⊢ A ∈ ℝ ∧ B ∈ ℝ ∧ C ∈ ℝ ∧ 0 < C ∧ A < B → A ⁢ C < B ⁢ C