Metamath Proof Explorer


Theorem dvdscmulr

Description: Cancellation law for the divides relation. Theorem 1.1(e) in ApostolNT p. 14. (Contributed by Paul Chapman, 21-Mar-2011)

Ref Expression
Assertion dvdscmulr ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 → K ⋅ M ∥ K ⋅ N ↔ M ∥ N

Proof

Step Hyp Ref Expression
1 zmulcl ⊢ K ∈ ℤ ∧ M ∈ ℤ → K ⋅ M ∈ ℤ
2 1 3adant3 ⊢ K ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ → K ⋅ M ∈ ℤ
3 zmulcl ⊢ K ∈ ℤ ∧ N ∈ ℤ → K ⋅ N ∈ ℤ
4 3 3adant2 ⊢ K ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ → K ⋅ N ∈ ℤ
5 2 4 jca ⊢ K ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ → K ⋅ M ∈ ℤ ∧ K ⋅ N ∈ ℤ
6 5 3coml ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ → K ⋅ M ∈ ℤ ∧ K ⋅ N ∈ ℤ
7 6 3adant3r ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 → K ⋅ M ∈ ℤ ∧ K ⋅ N ∈ ℤ
8 3simpa ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 → M ∈ ℤ ∧ N ∈ ℤ
9 simpr ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 ∧ x ∈ ℤ → x ∈ ℤ
10 zcn ⊢ x ∈ ℤ → x ∈ ℂ
11 zcn ⊢ M ∈ ℤ → M ∈ ℂ
12 10 11 anim12i ⊢ x ∈ ℤ ∧ M ∈ ℤ → x ∈ ℂ ∧ M ∈ ℂ
13 zcn ⊢ N ∈ ℤ → N ∈ ℂ
14 zcn ⊢ K ∈ ℤ → K ∈ ℂ
15 14 anim1i ⊢ K ∈ ℤ ∧ K ≠ 0 → K ∈ ℂ ∧ K ≠ 0
16 mul12 ⊢ K ∈ ℂ ∧ x ∈ ℂ ∧ M ∈ ℂ → K ⁢ x ⋅ M = x ⁢ K ⋅ M
17 16 3adant1r ⊢ K ∈ ℂ ∧ K ≠ 0 ∧ x ∈ ℂ ∧ M ∈ ℂ → K ⁢ x ⋅ M = x ⁢ K ⋅ M
18 17 3expb ⊢ K ∈ ℂ ∧ K ≠ 0 ∧ x ∈ ℂ ∧ M ∈ ℂ → K ⁢ x ⋅ M = x ⁢ K ⋅ M
19 18 ancoms ⊢ x ∈ ℂ ∧ M ∈ ℂ ∧ K ∈ ℂ ∧ K ≠ 0 → K ⁢ x ⋅ M = x ⁢ K ⋅ M
20 19 3adant2 ⊢ x ∈ ℂ ∧ M ∈ ℂ ∧ N ∈ ℂ ∧ K ∈ ℂ ∧ K ≠ 0 → K ⁢ x ⋅ M = x ⁢ K ⋅ M
21 20 eqeq1d ⊢ x ∈ ℂ ∧ M ∈ ℂ ∧ N ∈ ℂ ∧ K ∈ ℂ ∧ K ≠ 0 → K ⁢ x ⋅ M = K ⋅ N ↔ x ⁢ K ⋅ M = K ⋅ N
22 mulcl ⊢ x ∈ ℂ ∧ M ∈ ℂ → x ⋅ M ∈ ℂ
23 mulcan ⊢ x ⋅ M ∈ ℂ ∧ N ∈ ℂ ∧ K ∈ ℂ ∧ K ≠ 0 → K ⁢ x ⋅ M = K ⋅ N ↔ x ⋅ M = N
24 22 23 syl3an1 ⊢ x ∈ ℂ ∧ M ∈ ℂ ∧ N ∈ ℂ ∧ K ∈ ℂ ∧ K ≠ 0 → K ⁢ x ⋅ M = K ⋅ N ↔ x ⋅ M = N
25 21 24 bitr3d ⊢ x ∈ ℂ ∧ M ∈ ℂ ∧ N ∈ ℂ ∧ K ∈ ℂ ∧ K ≠ 0 → x ⁢ K ⋅ M = K ⋅ N ↔ x ⋅ M = N
26 12 13 15 25 syl3an ⊢ x ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 → x ⁢ K ⋅ M = K ⋅ N ↔ x ⋅ M = N
27 26 3expb ⊢ x ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 → x ⁢ K ⋅ M = K ⋅ N ↔ x ⋅ M = N
28 27 3impa ⊢ x ∈ ℤ ∧ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 → x ⁢ K ⋅ M = K ⋅ N ↔ x ⋅ M = N
29 28 3coml ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 ∧ x ∈ ℤ → x ⁢ K ⋅ M = K ⋅ N ↔ x ⋅ M = N
30 29 3expia ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 → x ∈ ℤ → x ⁢ K ⋅ M = K ⋅ N ↔ x ⋅ M = N
31 30 3impb ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 → x ∈ ℤ → x ⁢ K ⋅ M = K ⋅ N ↔ x ⋅ M = N
32 31 imp ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 ∧ x ∈ ℤ → x ⁢ K ⋅ M = K ⋅ N ↔ x ⋅ M = N
33 32 biimpd ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 ∧ x ∈ ℤ → x ⁢ K ⋅ M = K ⋅ N → x ⋅ M = N
34 7 8 9 33 dvds1lem ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 → K ⋅ M ∥ K ⋅ N → M ∥ N
35 dvdscmul ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ → M ∥ N → K ⋅ M ∥ K ⋅ N
36 35 3adant3r ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 → M ∥ N → K ⋅ M ∥ K ⋅ N
37 34 36 impbid ⊢ M ∈ ℤ ∧ N ∈ ℤ ∧ K ∈ ℤ ∧ K ≠ 0 → K ⋅ M ∥ K ⋅ N ↔ M ∥ N