Metamath Proof Explorer


Theorem dvdsmod

Description: Any number K whose mod base N is divisible by a divisor P of the base is also divisible by P . This means that primes will also be relatively prime to the base when reduced mod N for any base. (Contributed by Mario Carneiro, 13-Mar-2014)

Ref Expression
Assertion dvdsmod ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → P ∥ K mod N ↔ P ∥ K

Proof

Step Hyp Ref Expression
1 simpl3 ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → K ∈ ℤ
2 1 zred ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → K ∈ ℝ
3 simpl2 ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → N ∈ ℕ
4 3 nnrpd ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → N ∈ ℝ +
5 modval ⊢ K ∈ ℝ ∧ N ∈ ℝ + → K mod N = K − N ⁢ K N
6 2 4 5 syl2anc ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → K mod N = K − N ⁢ K N
7 6 breq2d ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → P ∥ K mod N ↔ P ∥ K − N ⁢ K N
8 simpl1 ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → P ∈ ℕ
9 8 nnzd ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → P ∈ ℤ
10 3 nnzd ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → N ∈ ℤ
11 2 3 nndivred ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → K N ∈ ℝ
12 11 flcld ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → K N ∈ ℤ
13 simpr ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → P ∥ N
14 9 10 12 13 dvdsmultr1d ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → P ∥ N ⁢ K N
15 10 12 zmulcld ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → N ⁢ K N ∈ ℤ
16 15 zcnd ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → N ⁢ K N ∈ ℂ
17 16 subid1d ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → N ⁢ K N − 0 = N ⁢ K N
18 14 17 breqtrrd ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → P ∥ N ⁢ K N − 0
19 0zd ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → 0 ∈ ℤ
20 moddvds ⊢ P ∈ ℕ ∧ N ⁢ K N ∈ ℤ ∧ 0 ∈ ℤ → N ⁢ K N mod P = 0 mod P ↔ P ∥ N ⁢ K N − 0
21 8 15 19 20 syl3anc ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → N ⁢ K N mod P = 0 mod P ↔ P ∥ N ⁢ K N − 0
22 18 21 mpbird ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → N ⁢ K N mod P = 0 mod P
23 22 eqeq2d ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → K mod P = N ⁢ K N mod P ↔ K mod P = 0 mod P
24 moddvds ⊢ P ∈ ℕ ∧ K ∈ ℤ ∧ N ⁢ K N ∈ ℤ → K mod P = N ⁢ K N mod P ↔ P ∥ K − N ⁢ K N
25 8 1 15 24 syl3anc ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → K mod P = N ⁢ K N mod P ↔ P ∥ K − N ⁢ K N
26 moddvds ⊢ P ∈ ℕ ∧ K ∈ ℤ ∧ 0 ∈ ℤ → K mod P = 0 mod P ↔ P ∥ K − 0
27 8 1 19 26 syl3anc ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → K mod P = 0 mod P ↔ P ∥ K − 0
28 23 25 27 3bitr3d ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → P ∥ K − N ⁢ K N ↔ P ∥ K − 0
29 1 zcnd ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → K ∈ ℂ
30 29 subid1d ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → K − 0 = K
31 30 breq2d ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → P ∥ K − 0 ↔ P ∥ K
32 7 28 31 3bitrd ⊢ P ∈ ℕ ∧ N ∈ ℕ ∧ K ∈ ℤ ∧ P ∥ N → P ∥ K mod N ↔ P ∥ K