Metamath Proof Explorer


Theorem pc2dvds

Description: A characterization of divisibility in terms of prime count. (Contributed by Mario Carneiro, 23-Feb-2014) (Revised by Mario Carneiro, 3-Oct-2014)

Ref Expression
Assertion pc2dvds ⊢ A ∈ ℤ ∧ B ∈ ℤ → A ∥ B ↔ ∀ p ∈ ℙ p pCnt A ≤ p pCnt B

Proof

Step Hyp Ref Expression
1 pcdvdstr ⊢ p ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B → p pCnt A ≤ p pCnt B
2 1 ancoms ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B ∧ p ∈ ℙ → p pCnt A ≤ p pCnt B
3 2 ralrimiva ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ∥ B → ∀ p ∈ ℙ p pCnt A ≤ p pCnt B
4 3 3expia ⊢ A ∈ ℤ ∧ B ∈ ℤ → A ∥ B → ∀ p ∈ ℙ p pCnt A ≤ p pCnt B
5 oveq2 ⊢ A = 0 → p pCnt A = p pCnt 0
6 5 breq1d ⊢ A = 0 → p pCnt A ≤ p pCnt B ↔ p pCnt 0 ≤ p pCnt B
7 6 ralbidv ⊢ A = 0 → ∀ p ∈ ℙ p pCnt A ≤ p pCnt B ↔ ∀ p ∈ ℙ p pCnt 0 ≤ p pCnt B
8 breq1 ⊢ A = 0 → A ∥ B ↔ 0 ∥ B
9 7 8 imbi12d ⊢ A = 0 → ∀ p ∈ ℙ p pCnt A ≤ p pCnt B → A ∥ B ↔ ∀ p ∈ ℙ p pCnt 0 ≤ p pCnt B → 0 ∥ B
10 gcddvds ⊢ A ∈ ℤ ∧ B ∈ ℤ → A gcd B ∥ A ∧ A gcd B ∥ B
11 10 simpld ⊢ A ∈ ℤ ∧ B ∈ ℤ → A gcd B ∥ A
12 gcdcl ⊢ A ∈ ℤ ∧ B ∈ ℤ → A gcd B ∈ ℕ 0
13 12 nn0zd ⊢ A ∈ ℤ ∧ B ∈ ℤ → A gcd B ∈ ℤ
14 simpl ⊢ A ∈ ℤ ∧ B ∈ ℤ → A ∈ ℤ
15 dvdsabsb ⊢ A gcd B ∈ ℤ ∧ A ∈ ℤ → A gcd B ∥ A ↔ A gcd B ∥ A
16 13 14 15 syl2anc ⊢ A ∈ ℤ ∧ B ∈ ℤ → A gcd B ∥ A ↔ A gcd B ∥ A
17 11 16 mpbid ⊢ A ∈ ℤ ∧ B ∈ ℤ → A gcd B ∥ A
18 17 adantr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A gcd B ∥ A
19 simpl ⊢ A = 0 ∧ B = 0 → A = 0
20 19 necon3ai ⊢ A ≠ 0 → ¬ A = 0 ∧ B = 0
21 gcdn0cl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ ¬ A = 0 ∧ B = 0 → A gcd B ∈ ℕ
22 20 21 sylan2 ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A gcd B ∈ ℕ
23 22 nnzd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A gcd B ∈ ℤ
24 22 nnne0d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A gcd B ≠ 0
25 nnabscl ⊢ A ∈ ℤ ∧ A ≠ 0 → A ∈ ℕ
26 25 adantlr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A ∈ ℕ
27 26 nnzd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A ∈ ℤ
28 dvdsval2 ⊢ A gcd B ∈ ℤ ∧ A gcd B ≠ 0 ∧ A ∈ ℤ → A gcd B ∥ A ↔ A A gcd B ∈ ℤ
29 23 24 27 28 syl3anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A gcd B ∥ A ↔ A A gcd B ∈ ℤ
30 18 29 mpbid ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A A gcd B ∈ ℤ
31 nnre ⊢ A ∈ ℕ → A ∈ ℝ
32 nngt0 ⊢ A ∈ ℕ → 0 < A
33 31 32 jca ⊢ A ∈ ℕ → A ∈ ℝ ∧ 0 < A
34 nnre ⊢ A gcd B ∈ ℕ → A gcd B ∈ ℝ
35 nngt0 ⊢ A gcd B ∈ ℕ → 0 < A gcd B
36 34 35 jca ⊢ A gcd B ∈ ℕ → A gcd B ∈ ℝ ∧ 0 < A gcd B
37 divgt0 ⊢ A ∈ ℝ ∧ 0 < A ∧ A gcd B ∈ ℝ ∧ 0 < A gcd B → 0 < A A gcd B
38 33 36 37 syl2an ⊢ A ∈ ℕ ∧ A gcd B ∈ ℕ → 0 < A A gcd B
39 26 22 38 syl2anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → 0 < A A gcd B
40 elnnz ⊢ A A gcd B ∈ ℕ ↔ A A gcd B ∈ ℤ ∧ 0 < A A gcd B
41 30 39 40 sylanbrc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A A gcd B ∈ ℕ
42 elnn1uz2 ⊢ A A gcd B ∈ ℕ ↔ A A gcd B = 1 ∨ A A gcd B ∈ ℤ ≥ 2
43 41 42 sylib ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A A gcd B = 1 ∨ A A gcd B ∈ ℤ ≥ 2
44 10 simprd ⊢ A ∈ ℤ ∧ B ∈ ℤ → A gcd B ∥ B
45 44 adantr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A gcd B ∥ B
46 breq1 ⊢ A gcd B = A → A gcd B ∥ B ↔ A ∥ B
47 45 46 syl5ibcom ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A gcd B = A → A ∥ B
48 26 nncnd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A ∈ ℂ
49 22 nncnd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A gcd B ∈ ℂ
50 1cnd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → 1 ∈ ℂ
51 48 49 50 24 divmuld ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A A gcd B = 1 ↔ A gcd B ⋅ 1 = A
52 49 mulridd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A gcd B ⋅ 1 = A gcd B
53 52 eqeq1d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A gcd B ⋅ 1 = A ↔ A gcd B = A
54 51 53 bitrd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A A gcd B = 1 ↔ A gcd B = A
55 absdvdsb ⊢ A ∈ ℤ ∧ B ∈ ℤ → A ∥ B ↔ A ∥ B
56 55 adantr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A ∥ B ↔ A ∥ B
57 47 54 56 3imtr4d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A A gcd B = 1 → A ∥ B
58 exprmfct ⊢ A A gcd B ∈ ℤ ≥ 2 → ∃ p ∈ ℙ p ∥ A A gcd B
59 simprl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p ∈ ℙ
60 26 adantr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → A ∈ ℕ
61 60 nnzd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → A ∈ ℤ
62 60 nnne0d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → A ≠ 0
63 22 adantr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → A gcd B ∈ ℕ
64 pcdiv ⊢ p ∈ ℙ ∧ A ∈ ℤ ∧ A ≠ 0 ∧ A gcd B ∈ ℕ → p pCnt A A gcd B = p pCnt A − p pCnt A gcd B
65 59 61 62 63 64 syl121anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A A gcd B = p pCnt A − p pCnt A gcd B
66 simplll ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → A ∈ ℤ
67 zq ⊢ A ∈ ℤ → A ∈ ℚ
68 66 67 syl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → A ∈ ℚ
69 pcabs ⊢ p ∈ ℙ ∧ A ∈ ℚ → p pCnt A = p pCnt A
70 59 68 69 syl2anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A = p pCnt A
71 70 oveq1d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A − p pCnt A gcd B = p pCnt A − p pCnt A gcd B
72 65 71 eqtrd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A A gcd B = p pCnt A − p pCnt A gcd B
73 simprr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p ∥ A A gcd B
74 41 adantr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → A A gcd B ∈ ℕ
75 pcelnn ⊢ p ∈ ℙ ∧ A A gcd B ∈ ℕ → p pCnt A A gcd B ∈ ℕ ↔ p ∥ A A gcd B
76 59 74 75 syl2anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A A gcd B ∈ ℕ ↔ p ∥ A A gcd B
77 73 76 mpbird ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A A gcd B ∈ ℕ
78 72 77 eqeltrrd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A − p pCnt A gcd B ∈ ℕ
79 59 63 pccld ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A gcd B ∈ ℕ 0
80 79 nn0zd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A gcd B ∈ ℤ
81 simplr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → A ≠ 0
82 pczcl ⊢ p ∈ ℙ ∧ A ∈ ℤ ∧ A ≠ 0 → p pCnt A ∈ ℕ 0
83 59 66 81 82 syl12anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A ∈ ℕ 0
84 83 nn0zd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A ∈ ℤ
85 znnsub ⊢ p pCnt A gcd B ∈ ℤ ∧ p pCnt A ∈ ℤ → p pCnt A gcd B < p pCnt A ↔ p pCnt A − p pCnt A gcd B ∈ ℕ
86 80 84 85 syl2anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A gcd B < p pCnt A ↔ p pCnt A − p pCnt A gcd B ∈ ℕ
87 78 86 mpbird ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A gcd B < p pCnt A
88 79 nn0red ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A gcd B ∈ ℝ
89 83 nn0red ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A ∈ ℝ
90 88 89 ltnled ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A gcd B < p pCnt A ↔ ¬ p pCnt A ≤ p pCnt A gcd B
91 87 90 mpbid ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → ¬ p pCnt A ≤ p pCnt A gcd B
92 simpllr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → B ∈ ℤ
93 nprmdvds1 ⊢ p ∈ ℙ → ¬ p ∥ 1
94 93 ad2antrl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → ¬ p ∥ 1
95 gcdid0 ⊢ A ∈ ℤ → A gcd 0 = A
96 66 95 syl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → A gcd 0 = A
97 96 oveq2d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → A A gcd 0 = A A
98 48 adantr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → A ∈ ℂ
99 98 62 dividd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → A A = 1
100 97 99 eqtrd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → A A gcd 0 = 1
101 100 breq2d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p ∥ A A gcd 0 ↔ p ∥ 1
102 94 101 mtbird ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → ¬ p ∥ A A gcd 0
103 oveq2 ⊢ B = 0 → A gcd B = A gcd 0
104 103 oveq2d ⊢ B = 0 → A A gcd B = A A gcd 0
105 104 breq2d ⊢ B = 0 → p ∥ A A gcd B ↔ p ∥ A A gcd 0
106 73 105 syl5ibcom ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → B = 0 → p ∥ A A gcd 0
107 106 necon3bd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → ¬ p ∥ A A gcd 0 → B ≠ 0
108 102 107 mpd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → B ≠ 0
109 pczcl ⊢ p ∈ ℙ ∧ B ∈ ℤ ∧ B ≠ 0 → p pCnt B ∈ ℕ 0
110 59 92 108 109 syl12anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt B ∈ ℕ 0
111 110 nn0red ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt B ∈ ℝ
112 lemin ⊢ p pCnt A ∈ ℝ ∧ p pCnt A ∈ ℝ ∧ p pCnt B ∈ ℝ → p pCnt A ≤ if p pCnt A ≤ p pCnt B p pCnt A p pCnt B ↔ p pCnt A ≤ p pCnt A ∧ p pCnt A ≤ p pCnt B
113 89 89 111 112 syl3anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A ≤ if p pCnt A ≤ p pCnt B p pCnt A p pCnt B ↔ p pCnt A ≤ p pCnt A ∧ p pCnt A ≤ p pCnt B
114 pcgcd ⊢ p ∈ ℙ ∧ A ∈ ℤ ∧ B ∈ ℤ → p pCnt A gcd B = if p pCnt A ≤ p pCnt B p pCnt A p pCnt B
115 59 66 92 114 syl3anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A gcd B = if p pCnt A ≤ p pCnt B p pCnt A p pCnt B
116 115 breq2d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A ≤ p pCnt A gcd B ↔ p pCnt A ≤ if p pCnt A ≤ p pCnt B p pCnt A p pCnt B
117 89 leidd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A ≤ p pCnt A
118 117 biantrurd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A ≤ p pCnt B ↔ p pCnt A ≤ p pCnt A ∧ p pCnt A ≤ p pCnt B
119 113 116 118 3bitr4rd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → p pCnt A ≤ p pCnt B ↔ p pCnt A ≤ p pCnt A gcd B
120 91 119 mtbird ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ ∧ p ∥ A A gcd B → ¬ p pCnt A ≤ p pCnt B
121 120 expr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 ∧ p ∈ ℙ → p ∥ A A gcd B → ¬ p pCnt A ≤ p pCnt B
122 121 reximdva ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → ∃ p ∈ ℙ p ∥ A A gcd B → ∃ p ∈ ℙ ¬ p pCnt A ≤ p pCnt B
123 rexnal ⊢ ∃ p ∈ ℙ ¬ p pCnt A ≤ p pCnt B ↔ ¬ ∀ p ∈ ℙ p pCnt A ≤ p pCnt B
124 122 123 imbitrdi ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → ∃ p ∈ ℙ p ∥ A A gcd B → ¬ ∀ p ∈ ℙ p pCnt A ≤ p pCnt B
125 58 124 syl5 ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A A gcd B ∈ ℤ ≥ 2 → ¬ ∀ p ∈ ℙ p pCnt A ≤ p pCnt B
126 57 125 orim12d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A A gcd B = 1 ∨ A A gcd B ∈ ℤ ≥ 2 → A ∥ B ∨ ¬ ∀ p ∈ ℙ p pCnt A ≤ p pCnt B
127 43 126 mpd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → A ∥ B ∨ ¬ ∀ p ∈ ℙ p pCnt A ≤ p pCnt B
128 127 ord ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → ¬ A ∥ B → ¬ ∀ p ∈ ℙ p pCnt A ≤ p pCnt B
129 128 con4d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ A ≠ 0 → ∀ p ∈ ℙ p pCnt A ≤ p pCnt B → A ∥ B
130 2prm ⊢ 2 ∈ ℙ
131 130 ne0ii ⊢ ℙ ≠ ∅
132 r19.2z ⊢ ℙ ≠ ∅ ∧ ∀ p ∈ ℙ p pCnt 0 ≤ p pCnt B → ∃ p ∈ ℙ p pCnt 0 ≤ p pCnt B
133 131 132 mpan ⊢ ∀ p ∈ ℙ p pCnt 0 ≤ p pCnt B → ∃ p ∈ ℙ p pCnt 0 ≤ p pCnt B
134 id ⊢ p ∈ ℙ → p ∈ ℙ
135 zq ⊢ B ∈ ℤ → B ∈ ℚ
136 135 adantl ⊢ A ∈ ℤ ∧ B ∈ ℤ → B ∈ ℚ
137 pcxcl ⊢ p ∈ ℙ ∧ B ∈ ℚ → p pCnt B ∈ ℝ *
138 134 136 137 syl2anr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ p ∈ ℙ → p pCnt B ∈ ℝ *
139 pnfge ⊢ p pCnt B ∈ ℝ * → p pCnt B ≤ +∞
140 138 139 syl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ p ∈ ℙ → p pCnt B ≤ +∞
141 140 biantrurd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ p ∈ ℙ → +∞ ≤ p pCnt B ↔ p pCnt B ≤ +∞ ∧ +∞ ≤ p pCnt B
142 pc0 ⊢ p ∈ ℙ → p pCnt 0 = +∞
143 142 adantl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ p ∈ ℙ → p pCnt 0 = +∞
144 143 breq1d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ p ∈ ℙ → p pCnt 0 ≤ p pCnt B ↔ +∞ ≤ p pCnt B
145 pnfxr ⊢ +∞ ∈ ℝ *
146 xrletri3 ⊢ p pCnt B ∈ ℝ * ∧ +∞ ∈ ℝ * → p pCnt B = +∞ ↔ p pCnt B ≤ +∞ ∧ +∞ ≤ p pCnt B
147 138 145 146 sylancl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ p ∈ ℙ → p pCnt B = +∞ ↔ p pCnt B ≤ +∞ ∧ +∞ ≤ p pCnt B
148 141 144 147 3bitr4d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ p ∈ ℙ → p pCnt 0 ≤ p pCnt B ↔ p pCnt B = +∞
149 pnfnre ⊢ +∞ ∉ ℝ
150 149 neli ⊢ ¬ +∞ ∈ ℝ
151 eleq1 ⊢ p pCnt B = +∞ → p pCnt B ∈ ℝ ↔ +∞ ∈ ℝ
152 150 151 mtbiri ⊢ p pCnt B = +∞ → ¬ p pCnt B ∈ ℝ
153 109 nn0red ⊢ p ∈ ℙ ∧ B ∈ ℤ ∧ B ≠ 0 → p pCnt B ∈ ℝ
154 153 adantll ⊢ A ∈ ℤ ∧ p ∈ ℙ ∧ B ∈ ℤ ∧ B ≠ 0 → p pCnt B ∈ ℝ
155 154 an4s ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ p ∈ ℙ ∧ B ≠ 0 → p pCnt B ∈ ℝ
156 155 expr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ p ∈ ℙ → B ≠ 0 → p pCnt B ∈ ℝ
157 156 necon1bd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ p ∈ ℙ → ¬ p pCnt B ∈ ℝ → B = 0
158 152 157 syl5 ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ p ∈ ℙ → p pCnt B = +∞ → B = 0
159 148 158 sylbid ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ p ∈ ℙ → p pCnt 0 ≤ p pCnt B → B = 0
160 159 rexlimdva ⊢ A ∈ ℤ ∧ B ∈ ℤ → ∃ p ∈ ℙ p pCnt 0 ≤ p pCnt B → B = 0
161 0dvds ⊢ B ∈ ℤ → 0 ∥ B ↔ B = 0
162 161 adantl ⊢ A ∈ ℤ ∧ B ∈ ℤ → 0 ∥ B ↔ B = 0
163 160 162 sylibrd ⊢ A ∈ ℤ ∧ B ∈ ℤ → ∃ p ∈ ℙ p pCnt 0 ≤ p pCnt B → 0 ∥ B
164 133 163 syl5 ⊢ A ∈ ℤ ∧ B ∈ ℤ → ∀ p ∈ ℙ p pCnt 0 ≤ p pCnt B → 0 ∥ B
165 9 129 164 pm2.61ne ⊢ A ∈ ℤ ∧ B ∈ ℤ → ∀ p ∈ ℙ p pCnt A ≤ p pCnt B → A ∥ B
166 4 165 impbid ⊢ A ∈ ℤ ∧ B ∈ ℤ → A ∥ B ↔ ∀ p ∈ ℙ p pCnt A ≤ p pCnt B