Theorem pcprmpw2 13135

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

Assertion

Ref	Expression
pcprmpw2	⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛) ↔ 𝐴 = (𝑃↑(𝑃 pCnt 𝐴))))

Distinct variable groups:   𝐴,𝑛   𝑃,𝑛

Proof of Theorem pcprmpw2

Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplr 533	. . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝐴 ∈ ℕ)
2	1	nnnn0d 9625	. . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝐴 ∈ ℕ0)
3		prmnn 12907	. . . . . . 7 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
4	3	ad2antrr 492	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝑃 ∈ ℕ)
5		pccl 13101	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝑃 pCnt 𝐴) ∈ ℕ0)
6	5	adantr 276	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃 pCnt 𝐴) ∈ ℕ0)
7	4, 6	nnexpcld 11148	. . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℕ)
8	7	nnnn0d 9625	. . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℕ0)
9	6	nn0red 9626	. . . . . . . . . . 11 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃 pCnt 𝐴) ∈ ℝ)
10	9	leidd 8844	. . . . . . . . . 10 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃 pCnt 𝐴) ≤ (𝑃 pCnt 𝐴))
11		simpll 531	. . . . . . . . . . 11 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝑃 ∈ ℙ)
12	6	nn0zd 9771	. . . . . . . . . . 11 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃 pCnt 𝐴) ∈ ℤ)
13		pcid 13126	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃 pCnt 𝐴) ∈ ℤ) → (𝑃 pCnt (𝑃↑(𝑃 pCnt 𝐴))) = (𝑃 pCnt 𝐴))
14	11, 12, 13	syl2anc 415	. . . . . . . . . 10 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃 pCnt (𝑃↑(𝑃 pCnt 𝐴))) = (𝑃 pCnt 𝐴))
15	10, 14	breqtrrd 4158	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃 pCnt 𝐴) ≤ (𝑃 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
16	15	ad2antrr 492	. . . . . . . 8 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 = 𝑃) → (𝑃 pCnt 𝐴) ≤ (𝑃 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
17		simpr 110	. . . . . . . . 9 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 = 𝑃) → 𝑝 = 𝑃)
18	17	oveq1d 6100	. . . . . . . 8 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 = 𝑃) → (𝑝 pCnt 𝐴) = (𝑃 pCnt 𝐴))
19	17	oveq1d 6100	. . . . . . . 8 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 = 𝑃) → (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))) = (𝑃 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
20	16, 18, 19	3brtr4d 4162	. . . . . . 7 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 = 𝑃) → (𝑝 pCnt 𝐴) ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
21		simplrr 542	. . . . . . . . . . . . 13 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝐴 ∥ (𝑃↑𝑛))
22		prmz 12908	. . . . . . . . . . . . . . 15 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℤ)
23	22	adantl 277	. . . . . . . . . . . . . 14 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝑝 ∈ ℤ)
24	1	adantr 276	. . . . . . . . . . . . . . 15 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝐴 ∈ ℕ)
25	24	nnzd 9772	. . . . . . . . . . . . . 14 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝐴 ∈ ℤ)
26		simprl 535	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝑛 ∈ ℕ0)
27	4, 26	nnexpcld 11148	. . . . . . . . . . . . . . . 16 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃↑𝑛) ∈ ℕ)
28	27	adantr 276	. . . . . . . . . . . . . . 15 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑃↑𝑛) ∈ ℕ)
29	28	nnzd 9772	. . . . . . . . . . . . . 14 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑃↑𝑛) ∈ ℤ)
30		dvdstr 12614	. . . . . . . . . . . . . 14 ⊢ ((𝑝 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ (𝑃↑𝑛) ∈ ℤ) → ((𝑝 ∥ 𝐴 ∧ 𝐴 ∥ (𝑃↑𝑛)) → 𝑝 ∥ (𝑃↑𝑛)))
31	23, 25, 29, 30	syl3anc 1278	. . . . . . . . . . . . 13 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → ((𝑝 ∥ 𝐴 ∧ 𝐴 ∥ (𝑃↑𝑛)) → 𝑝 ∥ (𝑃↑𝑛)))
32	21, 31	mpan2d 432	. . . . . . . . . . . 12 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑝 ∥ 𝐴 → 𝑝 ∥ (𝑃↑𝑛)))
33		simpr 110	. . . . . . . . . . . . 13 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝑝 ∈ ℙ)
34	11	adantr 276	. . . . . . . . . . . . 13 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝑃 ∈ ℙ)
35		simplrl 541	. . . . . . . . . . . . 13 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝑛 ∈ ℕ0)
36		prmdvdsexpr 12948	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∈ ℙ ∧ 𝑃 ∈ ℙ ∧ 𝑛 ∈ ℕ0) → (𝑝 ∥ (𝑃↑𝑛) → 𝑝 = 𝑃))
37	33, 34, 35, 36	syl3anc 1278	. . . . . . . . . . . 12 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑝 ∥ (𝑃↑𝑛) → 𝑝 = 𝑃))
38	32, 37	syld 45	. . . . . . . . . . 11 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑝 ∥ 𝐴 → 𝑝 = 𝑃))
39	38	necon3ad 2462	. . . . . . . . . 10 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑝 ≠ 𝑃 → ¬ 𝑝 ∥ 𝐴))
40	39	imp 124	. . . . . . . . 9 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → ¬ 𝑝 ∥ 𝐴)
41		simplr 533	. . . . . . . . . 10 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → 𝑝 ∈ ℙ)
42	1	ad2antrr 492	. . . . . . . . . 10 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → 𝐴 ∈ ℕ)
43		pceq0 13124	. . . . . . . . . 10 ⊢ ((𝑝 ∈ ℙ ∧ 𝐴 ∈ ℕ) → ((𝑝 pCnt 𝐴) = 0 ↔ ¬ 𝑝 ∥ 𝐴))
44	41, 42, 43	syl2anc 415	. . . . . . . . 9 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → ((𝑝 pCnt 𝐴) = 0 ↔ ¬ 𝑝 ∥ 𝐴))
45	40, 44	mpbird 167	. . . . . . . 8 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → (𝑝 pCnt 𝐴) = 0)
46	7	ad2antrr 492	. . . . . . . . . 10 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℕ)
47	41, 46	pccld 13102	. . . . . . . . 9 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ0)
48	47	nn0ge0d 9628	. . . . . . . 8 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → 0 ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
49	45, 48	eqbrtrd 4152	. . . . . . 7 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → (𝑝 pCnt 𝐴) ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
50		prmz 12908	. . . . . . . . . . 11 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
51	50	adantr 276	. . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → 𝑃 ∈ ℤ)
52	51	ad2antrr 492	. . . . . . . . 9 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝑃 ∈ ℤ)
53		zdceq 9725	. . . . . . . . 9 ⊢ ((𝑝 ∈ ℤ ∧ 𝑃 ∈ ℤ) → DECID 𝑝 = 𝑃)
54	23, 52, 53	syl2anc 415	. . . . . . . 8 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → DECID 𝑝 = 𝑃)
55		dcne 2431	. . . . . . . 8 ⊢ (DECID 𝑝 = 𝑃 ↔ (𝑝 = 𝑃 ∨ 𝑝 ≠ 𝑃))
56	54, 55	sylib 122	. . . . . . 7 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑝 = 𝑃 ∨ 𝑝 ≠ 𝑃))
57	20, 49, 56	mpjaodan 810	. . . . . 6 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑝 pCnt 𝐴) ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
58	57	ralrimiva 2623	. . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → ∀𝑝 ∈ ℙ (𝑝 pCnt 𝐴) ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
59	1	nnzd 9772	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝐴 ∈ ℤ)
60	7	nnzd 9772	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℤ)
61		pc2dvds 13132	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℤ) → (𝐴 ∥ (𝑃↑(𝑃 pCnt 𝐴)) ↔ ∀𝑝 ∈ ℙ (𝑝 pCnt 𝐴) ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴)))))
62	59, 60, 61	syl2anc 415	. . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝐴 ∥ (𝑃↑(𝑃 pCnt 𝐴)) ↔ ∀𝑝 ∈ ℙ (𝑝 pCnt 𝐴) ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴)))))
63	58, 62	mpbird 167	. . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝐴 ∥ (𝑃↑(𝑃 pCnt 𝐴)))
64		pcdvds 13117	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝑃↑(𝑃 pCnt 𝐴)) ∥ 𝐴)
65	64	adantr 276	. . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃↑(𝑃 pCnt 𝐴)) ∥ 𝐴)
66		dvdseq 12634	. . . 4 ⊢ (((𝐴 ∈ ℕ0 ∧ (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℕ0) ∧ (𝐴 ∥ (𝑃↑(𝑃 pCnt 𝐴)) ∧ (𝑃↑(𝑃 pCnt 𝐴)) ∥ 𝐴)) → 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))
67	2, 8, 63, 65, 66	syl22anc 1279	. . 3 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))
68	67	rexlimdvaa 2669	. 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛) → 𝐴 = (𝑃↑(𝑃 pCnt 𝐴))))
69	3	adantr 276	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → 𝑃 ∈ ℕ)
70	69, 5	nnexpcld 11148	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℕ)
71	70	nnzd 9772	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℤ)
72		iddvds 12590	. . . . 5 ⊢ ((𝑃↑(𝑃 pCnt 𝐴)) ∈ ℤ → (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑(𝑃 pCnt 𝐴)))
73	71, 72	syl 14	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑(𝑃 pCnt 𝐴)))
74		oveq2 6093	. . . . . 6 ⊢ (𝑛 = (𝑃 pCnt 𝐴) → (𝑃↑𝑛) = (𝑃↑(𝑃 pCnt 𝐴)))
75	74	breq2d 4142	. . . . 5 ⊢ (𝑛 = (𝑃 pCnt 𝐴) → ((𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑𝑛) ↔ (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑(𝑃 pCnt 𝐴))))
76	75	rspcev 2929	. . . 4 ⊢ (((𝑃 pCnt 𝐴) ∈ ℕ0 ∧ (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑(𝑃 pCnt 𝐴))) → ∃𝑛 ∈ ℕ0 (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑𝑛))
77	5, 73, 76	syl2anc 415	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → ∃𝑛 ∈ ℕ0 (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑𝑛))
78		breq1 4133	. . . 4 ⊢ (𝐴 = (𝑃↑(𝑃 pCnt 𝐴)) → (𝐴 ∥ (𝑃↑𝑛) ↔ (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑𝑛)))
79	78	rexbidv 2551	. . 3 ⊢ (𝐴 = (𝑃↑(𝑃 pCnt 𝐴)) → (∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛) ↔ ∃𝑛 ∈ ℕ0 (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑𝑛)))
80	77, 79	syl5ibrcom 157	. 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝐴 = (𝑃↑(𝑃 pCnt 𝐴)) → ∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛)))
81	68, 80	impbid 129	1 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛) ↔ 𝐴 = (𝑃↑(𝑃 pCnt 𝐴))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 720  DECID wdc 846   = wceq 1402   ∈ wcel 2209   ≠ wne 2420  ∀wral 2528  ∃wrex 2529   class class class wbr 4130  (class class class)co 6085  0cc0 8180   ≤ cle 8362  ℕcn 9307  ℕ₀cn0 9568  ℤcz 9649  ↑cexp 10990   ∥ cdvds 12573  ℙcprime 12904   pCnt cpc 13086

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-mulrcl 8279  ax-addcom 8280  ax-mulcom 8281  ax-addass 8282  ax-mulass 8283  ax-distr 8284  ax-i2m1 8285  ax-0lt1 8286  ax-1rid 8287  ax-0id 8288  ax-rnegex 8289  ax-precex 8290  ax-cnre 8291  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-lttrn 8294  ax-pre-apti 8295  ax-pre-ltadd 8296  ax-pre-mulgt0 8297  ax-pre-mulext 8298  ax-arch 8299  ax-caucvg 8300

This proof depends on definitions:  df-bi 117  df-stab 843  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-1st 6374  df-2nd 6375  df-recs 6576  df-frec 6662  df-1o 6687  df-2o 6688  df-er 6807  df-en 7023  df-sup 7325  df-inf 7326  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367  df-sub 8501  df-neg 8502  df-reap 8906  df-ap 8913  df-div 9006  df-inn 9308  df-2 9366  df-3 9367  df-4 9368  df-n0 9569  df-xnn0 9636  df-z 9650  df-uz 9932  df-q 10030  df-rp 10066  df-fz 10423  df-fzo 10561  df-fl 10716  df-mod 10775  df-seqfrec 10900  df-exp 10991  df-cj 11623  df-re 11624  df-im 11625  df-rsqrt 11780  df-abs 11781  df-dvds 12574  df-gcd 12750  df-prm 12905  df-pc 13087

This theorem is used by:  pcprmpw  13136  dvdsprmpweq  13137  dvdsppwf1o  16249