Metamath Proof Explorer


Theorem moddi

Description: Distribute multiplication over a modulo operation. (Contributed by NM, 11-Nov-2008)

Ref Expression
Assertion moddi ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ⁢ B mod C = A ⁢ B mod A ⁢ C

Proof

Step Hyp Ref Expression
1 rpcn ⊢ A ∈ ℝ + → A ∈ ℂ
2 1 3ad2ant1 ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ∈ ℂ
3 recn ⊢ B ∈ ℝ → B ∈ ℂ
4 3 3ad2ant2 ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → B ∈ ℂ
5 rpre ⊢ C ∈ ℝ + → C ∈ ℝ
6 5 adantl ⊢ B ∈ ℝ ∧ C ∈ ℝ + → C ∈ ℝ
7 refldivcl ⊢ B ∈ ℝ ∧ C ∈ ℝ + → B C ∈ ℝ
8 6 7 remulcld ⊢ B ∈ ℝ ∧ C ∈ ℝ + → C ⁢ B C ∈ ℝ
9 8 recnd ⊢ B ∈ ℝ ∧ C ∈ ℝ + → C ⁢ B C ∈ ℂ
10 9 3adant1 ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → C ⁢ B C ∈ ℂ
11 2 4 10 subdid ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ⁢ B − C ⁢ B C = A ⁢ B − A ⁢ C ⁢ B C
12 rpcnne0 ⊢ C ∈ ℝ + → C ∈ ℂ ∧ C ≠ 0
13 12 3ad2ant3 ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → C ∈ ℂ ∧ C ≠ 0
14 rpcnne0 ⊢ A ∈ ℝ + → A ∈ ℂ ∧ A ≠ 0
15 14 3ad2ant1 ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ∈ ℂ ∧ A ≠ 0
16 divcan5 ⊢ B ∈ ℂ ∧ C ∈ ℂ ∧ C ≠ 0 ∧ A ∈ ℂ ∧ A ≠ 0 → A ⁢ B A ⁢ C = B C
17 4 13 15 16 syl3anc ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ⁢ B A ⁢ C = B C
18 17 fveq2d ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ⁢ B A ⁢ C = B C
19 18 oveq2d ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ⁢ C ⁢ A ⁢ B A ⁢ C = A ⁢ C ⁢ B C
20 rpcn ⊢ C ∈ ℝ + → C ∈ ℂ
21 20 3ad2ant3 ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → C ∈ ℂ
22 rerpdivcl ⊢ B ∈ ℝ ∧ C ∈ ℝ + → B C ∈ ℝ
23 reflcl ⊢ B C ∈ ℝ → B C ∈ ℝ
24 23 recnd ⊢ B C ∈ ℝ → B C ∈ ℂ
25 22 24 syl ⊢ B ∈ ℝ ∧ C ∈ ℝ + → B C ∈ ℂ
26 25 3adant1 ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → B C ∈ ℂ
27 2 21 26 mulassd ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ⁢ C ⁢ B C = A ⁢ C ⁢ B C
28 19 27 eqtr2d ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ⁢ C ⁢ B C = A ⁢ C ⁢ A ⁢ B A ⁢ C
29 28 oveq2d ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ⁢ B − A ⁢ C ⁢ B C = A ⁢ B − A ⁢ C ⁢ A ⁢ B A ⁢ C
30 11 29 eqtrd ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ⁢ B − C ⁢ B C = A ⁢ B − A ⁢ C ⁢ A ⁢ B A ⁢ C
31 modval ⊢ B ∈ ℝ ∧ C ∈ ℝ + → B mod C = B − C ⁢ B C
32 31 3adant1 ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → B mod C = B − C ⁢ B C
33 32 oveq2d ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ⁢ B mod C = A ⁢ B − C ⁢ B C
34 rpre ⊢ A ∈ ℝ + → A ∈ ℝ
35 remulcl ⊢ A ∈ ℝ ∧ B ∈ ℝ → A ⁢ B ∈ ℝ
36 34 35 sylan ⊢ A ∈ ℝ + ∧ B ∈ ℝ → A ⁢ B ∈ ℝ
37 36 3adant3 ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ⁢ B ∈ ℝ
38 rpmulcl ⊢ A ∈ ℝ + ∧ C ∈ ℝ + → A ⁢ C ∈ ℝ +
39 modval ⊢ A ⁢ B ∈ ℝ ∧ A ⁢ C ∈ ℝ + → A ⁢ B mod A ⁢ C = A ⁢ B − A ⁢ C ⁢ A ⁢ B A ⁢ C
40 37 38 39 3imp3i2an ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ⁢ B mod A ⁢ C = A ⁢ B − A ⁢ C ⁢ A ⁢ B A ⁢ C
41 30 33 40 3eqtr4d ⊢ A ∈ ℝ + ∧ B ∈ ℝ ∧ C ∈ ℝ + → A ⁢ B mod C = A ⁢ B mod A ⁢ C