Metamath Proof Explorer


Theorem pcdvdsb

Description: P ^ A divides N if and only if A is at most the count of P . (Contributed by Mario Carneiro, 3-Oct-2014)

Ref Expression
Assertion pcdvdsb ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 → A ≤ P pCnt N ↔ P A ∥ N

Proof

Step Hyp Ref Expression
1 oveq2 ⊢ N = 0 → P pCnt N = P pCnt 0
2 1 breq2d ⊢ N = 0 → A ≤ P pCnt N ↔ A ≤ P pCnt 0
3 breq2 ⊢ N = 0 → P A ∥ N ↔ P A ∥ 0
4 2 3 bibi12d ⊢ N = 0 → A ≤ P pCnt N ↔ P A ∥ N ↔ A ≤ P pCnt 0 ↔ P A ∥ 0
5 simpl3 ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → A ∈ ℕ 0
6 5 nn0zd ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → A ∈ ℤ
7 simpl1 ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P ∈ ℙ
8 simpl2 ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → N ∈ ℤ
9 simpr ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → N ≠ 0
10 pczcl ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ N ≠ 0 → P pCnt N ∈ ℕ 0
11 7 8 9 10 syl12anc ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P pCnt N ∈ ℕ 0
12 11 nn0zd ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P pCnt N ∈ ℤ
13 eluz ⊢ A ∈ ℤ ∧ P pCnt N ∈ ℤ → P pCnt N ∈ ℤ ≥ A ↔ A ≤ P pCnt N
14 6 12 13 syl2anc ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P pCnt N ∈ ℤ ≥ A ↔ A ≤ P pCnt N
15 prmnn ⊢ P ∈ ℙ → P ∈ ℕ
16 7 15 syl ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P ∈ ℕ
17 16 nnzd ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P ∈ ℤ
18 dvdsexp ⊢ P ∈ ℤ ∧ A ∈ ℕ 0 ∧ P pCnt N ∈ ℤ ≥ A → P A ∥ P P pCnt N
19 18 3expia ⊢ P ∈ ℤ ∧ A ∈ ℕ 0 → P pCnt N ∈ ℤ ≥ A → P A ∥ P P pCnt N
20 17 5 19 syl2anc ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P pCnt N ∈ ℤ ≥ A → P A ∥ P P pCnt N
21 14 20 sylbird ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → A ≤ P pCnt N → P A ∥ P P pCnt N
22 pczdvds ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ N ≠ 0 → P P pCnt N ∥ N
23 7 8 9 22 syl12anc ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P P pCnt N ∥ N
24 nnexpcl ⊢ P ∈ ℕ ∧ A ∈ ℕ 0 → P A ∈ ℕ
25 15 24 sylan ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P A ∈ ℕ
26 25 3adant2 ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 → P A ∈ ℕ
27 26 nnzd ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 → P A ∈ ℤ
28 27 adantr ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P A ∈ ℤ
29 16 11 nnexpcld ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P P pCnt N ∈ ℕ
30 29 nnzd ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P P pCnt N ∈ ℤ
31 dvdstr ⊢ P A ∈ ℤ ∧ P P pCnt N ∈ ℤ ∧ N ∈ ℤ → P A ∥ P P pCnt N ∧ P P pCnt N ∥ N → P A ∥ N
32 28 30 8 31 syl3anc ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P A ∥ P P pCnt N ∧ P P pCnt N ∥ N → P A ∥ N
33 23 32 mpan2d ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P A ∥ P P pCnt N → P A ∥ N
34 21 33 syld ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → A ≤ P pCnt N → P A ∥ N
35 nn0re ⊢ P pCnt N ∈ ℕ 0 → P pCnt N ∈ ℝ
36 nn0re ⊢ A ∈ ℕ 0 → A ∈ ℝ
37 ltnle ⊢ P pCnt N ∈ ℝ ∧ A ∈ ℝ → P pCnt N < A ↔ ¬ A ≤ P pCnt N
38 35 36 37 syl2an ⊢ P pCnt N ∈ ℕ 0 ∧ A ∈ ℕ 0 → P pCnt N < A ↔ ¬ A ≤ P pCnt N
39 nn0ltp1le ⊢ P pCnt N ∈ ℕ 0 ∧ A ∈ ℕ 0 → P pCnt N < A ↔ P pCnt N + 1 ≤ A
40 38 39 bitr3d ⊢ P pCnt N ∈ ℕ 0 ∧ A ∈ ℕ 0 → ¬ A ≤ P pCnt N ↔ P pCnt N + 1 ≤ A
41 11 5 40 syl2anc ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → ¬ A ≤ P pCnt N ↔ P pCnt N + 1 ≤ A
42 peano2nn0 ⊢ P pCnt N ∈ ℕ 0 → P pCnt N + 1 ∈ ℕ 0
43 11 42 syl ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P pCnt N + 1 ∈ ℕ 0
44 43 nn0zd ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P pCnt N + 1 ∈ ℤ
45 eluz ⊢ P pCnt N + 1 ∈ ℤ ∧ A ∈ ℤ → A ∈ ℤ ≥ P pCnt N + 1 ↔ P pCnt N + 1 ≤ A
46 44 6 45 syl2anc ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → A ∈ ℤ ≥ P pCnt N + 1 ↔ P pCnt N + 1 ≤ A
47 dvdsexp ⊢ P ∈ ℤ ∧ P pCnt N + 1 ∈ ℕ 0 ∧ A ∈ ℤ ≥ P pCnt N + 1 → P P pCnt N + 1 ∥ P A
48 47 3expia ⊢ P ∈ ℤ ∧ P pCnt N + 1 ∈ ℕ 0 → A ∈ ℤ ≥ P pCnt N + 1 → P P pCnt N + 1 ∥ P A
49 17 43 48 syl2anc ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → A ∈ ℤ ≥ P pCnt N + 1 → P P pCnt N + 1 ∥ P A
50 46 49 sylbird ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P pCnt N + 1 ≤ A → P P pCnt N + 1 ∥ P A
51 pczndvds ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ N ≠ 0 → ¬ P P pCnt N + 1 ∥ N
52 7 8 9 51 syl12anc ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → ¬ P P pCnt N + 1 ∥ N
53 16 43 nnexpcld ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P P pCnt N + 1 ∈ ℕ
54 53 nnzd ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P P pCnt N + 1 ∈ ℤ
55 dvdstr ⊢ P P pCnt N + 1 ∈ ℤ ∧ P A ∈ ℤ ∧ N ∈ ℤ → P P pCnt N + 1 ∥ P A ∧ P A ∥ N → P P pCnt N + 1 ∥ N
56 54 28 8 55 syl3anc ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P P pCnt N + 1 ∥ P A ∧ P A ∥ N → P P pCnt N + 1 ∥ N
57 52 56 mtod ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → ¬ P P pCnt N + 1 ∥ P A ∧ P A ∥ N
58 imnan ⊢ P P pCnt N + 1 ∥ P A → ¬ P A ∥ N ↔ ¬ P P pCnt N + 1 ∥ P A ∧ P A ∥ N
59 57 58 sylibr ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P P pCnt N + 1 ∥ P A → ¬ P A ∥ N
60 50 59 syld ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → P pCnt N + 1 ≤ A → ¬ P A ∥ N
61 41 60 sylbid ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → ¬ A ≤ P pCnt N → ¬ P A ∥ N
62 34 61 impcon4bid ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 ∧ N ≠ 0 → A ≤ P pCnt N ↔ P A ∥ N
63 36 3ad2ant3 ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 → A ∈ ℝ
64 63 rexrd ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 → A ∈ ℝ *
65 pnfge ⊢ A ∈ ℝ * → A ≤ +∞
66 64 65 syl ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 → A ≤ +∞
67 pc0 ⊢ P ∈ ℙ → P pCnt 0 = +∞
68 67 3ad2ant1 ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 → P pCnt 0 = +∞
69 66 68 breqtrrd ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 → A ≤ P pCnt 0
70 dvds0 ⊢ P A ∈ ℤ → P A ∥ 0
71 27 70 syl ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 → P A ∥ 0
72 69 71 2thd ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 → A ≤ P pCnt 0 ↔ P A ∥ 0
73 4 62 72 pm2.61ne ⊢ P ∈ ℙ ∧ N ∈ ℤ ∧ A ∈ ℕ 0 → A ≤ P pCnt N ↔ P A ∥ N