Metamath Proof Explorer


Theorem pcprmpw2

Description: Self-referential expression for a prime power. (Contributed by Mario Carneiro, 16-Jan-2015)

Ref Expression
Assertion pcprmpw2 ⊢ P ∈ ℙ ∧ A ∈ ℕ → ∃ n ∈ ℕ 0 A ∥ P n ↔ A = P P pCnt A

Proof

Step Hyp Ref Expression
1 simplr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → A ∈ ℕ
2 1 nnnn0d ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → A ∈ ℕ 0
3 prmnn ⊢ P ∈ ℙ → P ∈ ℕ
4 3 ad2antrr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → P ∈ ℕ
5 pccl ⊢ P ∈ ℙ ∧ A ∈ ℕ → P pCnt A ∈ ℕ 0
6 5 adantr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → P pCnt A ∈ ℕ 0
7 4 6 nnexpcld ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → P P pCnt A ∈ ℕ
8 7 nnnn0d ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → P P pCnt A ∈ ℕ 0
9 6 nn0red ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → P pCnt A ∈ ℝ
10 9 leidd ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → P pCnt A ≤ P pCnt A
11 simpll ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → P ∈ ℙ
12 6 nn0zd ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → P pCnt A ∈ ℤ
13 pcid ⊢ P ∈ ℙ ∧ P pCnt A ∈ ℤ → P pCnt P P pCnt A = P pCnt A
14 11 12 13 syl2anc ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → P pCnt P P pCnt A = P pCnt A
15 10 14 breqtrrd ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → P pCnt A ≤ P pCnt P P pCnt A
16 15 ad2antrr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p = P → P pCnt A ≤ P pCnt P P pCnt A
17 simpr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p = P → p = P
18 17 oveq1d ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p = P → p pCnt A = P pCnt A
19 17 oveq1d ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p = P → p pCnt P P pCnt A = P pCnt P P pCnt A
20 16 18 19 3brtr4d ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p = P → p pCnt A ≤ p pCnt P P pCnt A
21 simplrr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → A ∥ P n
22 prmz ⊢ p ∈ ℙ → p ∈ ℤ
23 22 adantl ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → p ∈ ℤ
24 1 adantr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → A ∈ ℕ
25 24 nnzd ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → A ∈ ℤ
26 simprl ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → n ∈ ℕ 0
27 4 26 nnexpcld ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → P n ∈ ℕ
28 27 adantr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → P n ∈ ℕ
29 28 nnzd ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → P n ∈ ℤ
30 dvdstr ⊢ p ∈ ℤ ∧ A ∈ ℤ ∧ P n ∈ ℤ → p ∥ A ∧ A ∥ P n → p ∥ P n
31 23 25 29 30 syl3anc ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → p ∥ A ∧ A ∥ P n → p ∥ P n
32 21 31 mpan2d ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → p ∥ A → p ∥ P n
33 simpr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → p ∈ ℙ
34 11 adantr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → P ∈ ℙ
35 simplrl ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → n ∈ ℕ 0
36 prmdvdsexpr ⊢ p ∈ ℙ ∧ P ∈ ℙ ∧ n ∈ ℕ 0 → p ∥ P n → p = P
37 33 34 35 36 syl3anc ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → p ∥ P n → p = P
38 32 37 syld ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → p ∥ A → p = P
39 38 necon3ad ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → p ≠ P → ¬ p ∥ A
40 39 imp ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p ≠ P → ¬ p ∥ A
41 simplr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p ≠ P → p ∈ ℙ
42 1 ad2antrr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p ≠ P → A ∈ ℕ
43 pceq0 ⊢ p ∈ ℙ ∧ A ∈ ℕ → p pCnt A = 0 ↔ ¬ p ∥ A
44 41 42 43 syl2anc ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p ≠ P → p pCnt A = 0 ↔ ¬ p ∥ A
45 40 44 mpbird ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p ≠ P → p pCnt A = 0
46 7 ad2antrr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p ≠ P → P P pCnt A ∈ ℕ
47 41 46 pccld ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p ≠ P → p pCnt P P pCnt A ∈ ℕ 0
48 47 nn0ge0d ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p ≠ P → 0 ≤ p pCnt P P pCnt A
49 45 48 eqbrtrd ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ ∧ p ≠ P → p pCnt A ≤ p pCnt P P pCnt A
50 20 49 pm2.61dane ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n ∧ p ∈ ℙ → p pCnt A ≤ p pCnt P P pCnt A
51 50 ralrimiva ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → ∀ p ∈ ℙ p pCnt A ≤ p pCnt P P pCnt A
52 1 nnzd ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → A ∈ ℤ
53 7 nnzd ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → P P pCnt A ∈ ℤ
54 pc2dvds ⊢ A ∈ ℤ ∧ P P pCnt A ∈ ℤ → A ∥ P P pCnt A ↔ ∀ p ∈ ℙ p pCnt A ≤ p pCnt P P pCnt A
55 52 53 54 syl2anc ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → A ∥ P P pCnt A ↔ ∀ p ∈ ℙ p pCnt A ≤ p pCnt P P pCnt A
56 51 55 mpbird ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → A ∥ P P pCnt A
57 pcdvds ⊢ P ∈ ℙ ∧ A ∈ ℕ → P P pCnt A ∥ A
58 57 adantr ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → P P pCnt A ∥ A
59 dvdseq ⊢ A ∈ ℕ 0 ∧ P P pCnt A ∈ ℕ 0 ∧ A ∥ P P pCnt A ∧ P P pCnt A ∥ A → A = P P pCnt A
60 2 8 56 58 59 syl22anc ⊢ P ∈ ℙ ∧ A ∈ ℕ ∧ n ∈ ℕ 0 ∧ A ∥ P n → A = P P pCnt A
61 60 rexlimdvaa ⊢ P ∈ ℙ ∧ A ∈ ℕ → ∃ n ∈ ℕ 0 A ∥ P n → A = P P pCnt A
62 3 adantr ⊢ P ∈ ℙ ∧ A ∈ ℕ → P ∈ ℕ
63 62 5 nnexpcld ⊢ P ∈ ℙ ∧ A ∈ ℕ → P P pCnt A ∈ ℕ
64 63 nnzd ⊢ P ∈ ℙ ∧ A ∈ ℕ → P P pCnt A ∈ ℤ
65 iddvds ⊢ P P pCnt A ∈ ℤ → P P pCnt A ∥ P P pCnt A
66 64 65 syl ⊢ P ∈ ℙ ∧ A ∈ ℕ → P P pCnt A ∥ P P pCnt A
67 oveq2 ⊢ n = P pCnt A → P n = P P pCnt A
68 67 breq2d ⊢ n = P pCnt A → P P pCnt A ∥ P n ↔ P P pCnt A ∥ P P pCnt A
69 68 rspcev ⊢ P pCnt A ∈ ℕ 0 ∧ P P pCnt A ∥ P P pCnt A → ∃ n ∈ ℕ 0 P P pCnt A ∥ P n
70 5 66 69 syl2anc ⊢ P ∈ ℙ ∧ A ∈ ℕ → ∃ n ∈ ℕ 0 P P pCnt A ∥ P n
71 breq1 ⊢ A = P P pCnt A → A ∥ P n ↔ P P pCnt A ∥ P n
72 71 rexbidv ⊢ A = P P pCnt A → ∃ n ∈ ℕ 0 A ∥ P n ↔ ∃ n ∈ ℕ 0 P P pCnt A ∥ P n
73 70 72 syl5ibrcom ⊢ P ∈ ℙ ∧ A ∈ ℕ → A = P P pCnt A → ∃ n ∈ ℕ 0 A ∥ P n
74 61 73 impbid ⊢ P ∈ ℙ ∧ A ∈ ℕ → ∃ n ∈ ℕ 0 A ∥ P n ↔ A = P P pCnt A