Metamath Proof Explorer


Theorem pcidlem

Description: The prime count of a prime power. (Contributed by Mario Carneiro, 12-Mar-2014)

Ref Expression
Assertion pcidlem ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P pCnt P A = A

Proof

Step Hyp Ref Expression
1 simpl ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P ∈ ℙ
2 prmnn ⊢ P ∈ ℙ → P ∈ ℕ
3 1 2 syl ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P ∈ ℕ
4 simpr ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → A ∈ ℕ 0
5 3 4 nnexpcld ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P A ∈ ℕ
6 1 5 pccld ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P pCnt P A ∈ ℕ 0
7 6 nn0red ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P pCnt P A ∈ ℝ
8 7 leidd ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P pCnt P A ≤ P pCnt P A
9 5 nnzd ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P A ∈ ℤ
10 pcdvdsb ⊢ P ∈ ℙ ∧ P A ∈ ℤ ∧ P pCnt P A ∈ ℕ 0 → P pCnt P A ≤ P pCnt P A ↔ P P pCnt P A ∥ P A
11 1 9 6 10 syl3anc ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P pCnt P A ≤ P pCnt P A ↔ P P pCnt P A ∥ P A
12 8 11 mpbid ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P P pCnt P A ∥ P A
13 3 6 nnexpcld ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P P pCnt P A ∈ ℕ
14 13 nnzd ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P P pCnt P A ∈ ℤ
15 dvdsle ⊢ P P pCnt P A ∈ ℤ ∧ P A ∈ ℕ → P P pCnt P A ∥ P A → P P pCnt P A ≤ P A
16 14 5 15 syl2anc ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P P pCnt P A ∥ P A → P P pCnt P A ≤ P A
17 12 16 mpd ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P P pCnt P A ≤ P A
18 3 nnred ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P ∈ ℝ
19 6 nn0zd ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P pCnt P A ∈ ℤ
20 nn0z ⊢ A ∈ ℕ 0 → A ∈ ℤ
21 20 adantl ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → A ∈ ℤ
22 prmuz2 ⊢ P ∈ ℙ → P ∈ ℤ ≥ 2
23 eluz2gt1 ⊢ P ∈ ℤ ≥ 2 → 1 < P
24 1 22 23 3syl ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → 1 < P
25 18 19 21 24 leexp2d ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P pCnt P A ≤ A ↔ P P pCnt P A ≤ P A
26 17 25 mpbird ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P pCnt P A ≤ A
27 iddvds ⊢ P A ∈ ℤ → P A ∥ P A
28 9 27 syl ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P A ∥ P A
29 pcdvdsb ⊢ P ∈ ℙ ∧ P A ∈ ℤ ∧ A ∈ ℕ 0 → A ≤ P pCnt P A ↔ P A ∥ P A
30 1 9 4 29 syl3anc ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → A ≤ P pCnt P A ↔ P A ∥ P A
31 28 30 mpbird ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → A ≤ P pCnt P A
32 nn0re ⊢ A ∈ ℕ 0 → A ∈ ℝ
33 32 adantl ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → A ∈ ℝ
34 7 33 letri3d ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P pCnt P A = A ↔ P pCnt P A ≤ A ∧ A ≤ P pCnt P A
35 26 31 34 mpbir2and ⊢ P ∈ ℙ ∧ A ∈ ℕ 0 → P pCnt P A = A