Theorem pcprmpw2 12529

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 528	. . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝐴 ∈ ℕ)
2	1	nnnn0d 9321	. . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝐴 ∈ ℕ0)
3		prmnn 12305	. . . . . . 7 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
4	3	ad2antrr 488	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝑃 ∈ ℕ)
5		pccl 12495	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝑃 pCnt 𝐴) ∈ ℕ0)
6	5	adantr 276	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃 pCnt 𝐴) ∈ ℕ0)
7	4, 6	nnexpcld 10806	. . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℕ)
8	7	nnnn0d 9321	. . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℕ0)
9	6	nn0red 9322	. . . . . . . . . . 11 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃 pCnt 𝐴) ∈ ℝ)
10	9	leidd 8560	. . . . . . . . . 10 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃 pCnt 𝐴) ≤ (𝑃 pCnt 𝐴))
11		simpll 527	. . . . . . . . . . 11 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝑃 ∈ ℙ)
12	6	nn0zd 9465	. . . . . . . . . . 11 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃 pCnt 𝐴) ∈ ℤ)
13		pcid 12520	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℙ ∧ (𝑃 pCnt 𝐴) ∈ ℤ) → (𝑃 pCnt (𝑃↑(𝑃 pCnt 𝐴))) = (𝑃 pCnt 𝐴))
14	11, 12, 13	syl2anc 411	. . . . . . . . . 10 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃 pCnt (𝑃↑(𝑃 pCnt 𝐴))) = (𝑃 pCnt 𝐴))
15	10, 14	breqtrrd 4062	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃 pCnt 𝐴) ≤ (𝑃 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
16	15	ad2antrr 488	. . . . . . . 8 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 = 𝑃) → (𝑃 pCnt 𝐴) ≤ (𝑃 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
17		simpr 110	. . . . . . . . 9 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 = 𝑃) → 𝑝 = 𝑃)
18	17	oveq1d 5940	. . . . . . . 8 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 = 𝑃) → (𝑝 pCnt 𝐴) = (𝑃 pCnt 𝐴))
19	17	oveq1d 5940	. . . . . . . 8 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 = 𝑃) → (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))) = (𝑃 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
20	16, 18, 19	3brtr4d 4066	. . . . . . 7 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 = 𝑃) → (𝑝 pCnt 𝐴) ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
21		simplrr 536	. . . . . . . . . . . . 13 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝐴 ∥ (𝑃↑𝑛))
22		prmz 12306	. . . . . . . . . . . . . . 15 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℤ)
23	22	adantl 277	. . . . . . . . . . . . . 14 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝑝 ∈ ℤ)
24	1	adantr 276	. . . . . . . . . . . . . . 15 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝐴 ∈ ℕ)
25	24	nnzd 9466	. . . . . . . . . . . . . 14 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝐴 ∈ ℤ)
26		simprl 529	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝑛 ∈ ℕ0)
27	4, 26	nnexpcld 10806	. . . . . . . . . . . . . . . 16 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃↑𝑛) ∈ ℕ)
28	27	adantr 276	. . . . . . . . . . . . . . 15 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑃↑𝑛) ∈ ℕ)
29	28	nnzd 9466	. . . . . . . . . . . . . 14 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑃↑𝑛) ∈ ℤ)
30		dvdstr 12012	. . . . . . . . . . . . . 14 ⊢ ((𝑝 ∈ ℤ ∧ 𝐴 ∈ ℤ ∧ (𝑃↑𝑛) ∈ ℤ) → ((𝑝 ∥ 𝐴 ∧ 𝐴 ∥ (𝑃↑𝑛)) → 𝑝 ∥ (𝑃↑𝑛)))
31	23, 25, 29, 30	syl3anc 1249	. . . . . . . . . . . . 13 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → ((𝑝 ∥ 𝐴 ∧ 𝐴 ∥ (𝑃↑𝑛)) → 𝑝 ∥ (𝑃↑𝑛)))
32	21, 31	mpan2d 428	. . . . . . . . . . . 12 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑝 ∥ 𝐴 → 𝑝 ∥ (𝑃↑𝑛)))
33		simpr 110	. . . . . . . . . . . . 13 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝑝 ∈ ℙ)
34	11	adantr 276	. . . . . . . . . . . . 13 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝑃 ∈ ℙ)
35		simplrl 535	. . . . . . . . . . . . 13 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝑛 ∈ ℕ0)
36		prmdvdsexpr 12345	. . . . . . . . . . . . 13 ⊢ ((𝑝 ∈ ℙ ∧ 𝑃 ∈ ℙ ∧ 𝑛 ∈ ℕ0) → (𝑝 ∥ (𝑃↑𝑛) → 𝑝 = 𝑃))
37	33, 34, 35, 36	syl3anc 1249	. . . . . . . . . . . 12 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑝 ∥ (𝑃↑𝑛) → 𝑝 = 𝑃))
38	32, 37	syld 45	. . . . . . . . . . 11 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑝 ∥ 𝐴 → 𝑝 = 𝑃))
39	38	necon3ad 2409	. . . . . . . . . 10 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑝 ≠ 𝑃 → ¬ 𝑝 ∥ 𝐴))
40	39	imp 124	. . . . . . . . 9 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → ¬ 𝑝 ∥ 𝐴)
41		simplr 528	. . . . . . . . . 10 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → 𝑝 ∈ ℙ)
42	1	ad2antrr 488	. . . . . . . . . 10 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → 𝐴 ∈ ℕ)
43		pceq0 12518	. . . . . . . . . 10 ⊢ ((𝑝 ∈ ℙ ∧ 𝐴 ∈ ℕ) → ((𝑝 pCnt 𝐴) = 0 ↔ ¬ 𝑝 ∥ 𝐴))
44	41, 42, 43	syl2anc 411	. . . . . . . . 9 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → ((𝑝 pCnt 𝐴) = 0 ↔ ¬ 𝑝 ∥ 𝐴))
45	40, 44	mpbird 167	. . . . . . . 8 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → (𝑝 pCnt 𝐴) = 0)
46	7	ad2antrr 488	. . . . . . . . . 10 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℕ)
47	41, 46	pccld 12496	. . . . . . . . 9 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ0)
48	47	nn0ge0d 9324	. . . . . . . 8 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → 0 ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
49	45, 48	eqbrtrd 4056	. . . . . . 7 ⊢ (((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) ∧ 𝑝 ≠ 𝑃) → (𝑝 pCnt 𝐴) ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
50		prmz 12306	. . . . . . . . . . 11 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
51	50	adantr 276	. . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → 𝑃 ∈ ℤ)
52	51	ad2antrr 488	. . . . . . . . 9 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → 𝑃 ∈ ℤ)
53		zdceq 9420	. . . . . . . . 9 ⊢ ((𝑝 ∈ ℤ ∧ 𝑃 ∈ ℤ) → DECID 𝑝 = 𝑃)
54	23, 52, 53	syl2anc 411	. . . . . . . 8 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → DECID 𝑝 = 𝑃)
55		dcne 2378	. . . . . . . 8 ⊢ (DECID 𝑝 = 𝑃 ↔ (𝑝 = 𝑃 ∨ 𝑝 ≠ 𝑃))
56	54, 55	sylib 122	. . . . . . 7 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑝 = 𝑃 ∨ 𝑝 ≠ 𝑃))
57	20, 49, 56	mpjaodan 799	. . . . . 6 ⊢ ((((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) ∧ 𝑝 ∈ ℙ) → (𝑝 pCnt 𝐴) ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
58	57	ralrimiva 2570	. . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → ∀𝑝 ∈ ℙ (𝑝 pCnt 𝐴) ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴))))
59	1	nnzd 9466	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝐴 ∈ ℤ)
60	7	nnzd 9466	. . . . . 6 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℤ)
61		pc2dvds 12526	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℤ) → (𝐴 ∥ (𝑃↑(𝑃 pCnt 𝐴)) ↔ ∀𝑝 ∈ ℙ (𝑝 pCnt 𝐴) ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴)))))
62	59, 60, 61	syl2anc 411	. . . . 5 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝐴 ∥ (𝑃↑(𝑃 pCnt 𝐴)) ↔ ∀𝑝 ∈ ℙ (𝑝 pCnt 𝐴) ≤ (𝑝 pCnt (𝑃↑(𝑃 pCnt 𝐴)))))
63	58, 62	mpbird 167	. . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝐴 ∥ (𝑃↑(𝑃 pCnt 𝐴)))
64		pcdvds 12511	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝑃↑(𝑃 pCnt 𝐴)) ∥ 𝐴)
65	64	adantr 276	. . . 4 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → (𝑃↑(𝑃 pCnt 𝐴)) ∥ 𝐴)
66		dvdseq 12032	. . . 4 ⊢ (((𝐴 ∈ ℕ0 ∧ (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℕ0) ∧ (𝐴 ∥ (𝑃↑(𝑃 pCnt 𝐴)) ∧ (𝑃↑(𝑃 pCnt 𝐴)) ∥ 𝐴)) → 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))
67	2, 8, 63, 65, 66	syl22anc 1250	. . 3 ⊢ (((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) ∧ (𝑛 ∈ ℕ0 ∧ 𝐴 ∥ (𝑃↑𝑛))) → 𝐴 = (𝑃↑(𝑃 pCnt 𝐴)))
68	67	rexlimdvaa 2615	. 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛) → 𝐴 = (𝑃↑(𝑃 pCnt 𝐴))))
69	3	adantr 276	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → 𝑃 ∈ ℕ)
70	69, 5	nnexpcld 10806	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℕ)
71	70	nnzd 9466	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℤ)
72		iddvds 11988	. . . . 5 ⊢ ((𝑃↑(𝑃 pCnt 𝐴)) ∈ ℤ → (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑(𝑃 pCnt 𝐴)))
73	71, 72	syl 14	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑(𝑃 pCnt 𝐴)))
74		oveq2 5933	. . . . . 6 ⊢ (𝑛 = (𝑃 pCnt 𝐴) → (𝑃↑𝑛) = (𝑃↑(𝑃 pCnt 𝐴)))
75	74	breq2d 4046	. . . . 5 ⊢ (𝑛 = (𝑃 pCnt 𝐴) → ((𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑𝑛) ↔ (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑(𝑃 pCnt 𝐴))))
76	75	rspcev 2868	. . . 4 ⊢ (((𝑃 pCnt 𝐴) ∈ ℕ0 ∧ (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑(𝑃 pCnt 𝐴))) → ∃𝑛 ∈ ℕ0 (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑𝑛))
77	5, 73, 76	syl2anc 411	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → ∃𝑛 ∈ ℕ0 (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑𝑛))
78		breq1 4037	. . . 4 ⊢ (𝐴 = (𝑃↑(𝑃 pCnt 𝐴)) → (𝐴 ∥ (𝑃↑𝑛) ↔ (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑𝑛)))
79	78	rexbidv 2498	. . 3 ⊢ (𝐴 = (𝑃↑(𝑃 pCnt 𝐴)) → (∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛) ↔ ∃𝑛 ∈ ℕ0 (𝑃↑(𝑃 pCnt 𝐴)) ∥ (𝑃↑𝑛)))
80	77, 79	syl5ibrcom 157	. 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝐴 = (𝑃↑(𝑃 pCnt 𝐴)) → ∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛)))
81	68, 80	impbid 129	1 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (∃𝑛 ∈ ℕ0 𝐴 ∥ (𝑃↑𝑛) ↔ 𝐴 = (𝑃↑(𝑃 pCnt 𝐴))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 709  DECID wdc 835   = wceq 1364   ∈ wcel 2167   ≠ wne 2367  ∀wral 2475  ∃wrex 2476   class class class wbr 4034  (class class class)co 5925  0cc0 7898   ≤ cle 8081  ℕcn 9009  ℕ₀cn0 9268  ℤcz 9345  ↑cexp 10649   ∥ cdvds 11971  ℙcprime 12302   pCnt cpc 12480

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-nul 4160  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-iinf 4625  ax-cnex 7989  ax-resscn 7990  ax-1cn 7991  ax-1re 7992  ax-icn 7993  ax-addcl 7994  ax-addrcl 7995  ax-mulcl 7996  ax-mulrcl 7997  ax-addcom 7998  ax-mulcom 7999  ax-addass 8000  ax-mulass 8001  ax-distr 8002  ax-i2m1 8003  ax-0lt1 8004  ax-1rid 8005  ax-0id 8006  ax-rnegex 8007  ax-precex 8008  ax-cnre 8009  ax-pre-ltirr 8010  ax-pre-ltwlin 8011  ax-pre-lttrn 8012  ax-pre-apti 8013  ax-pre-ltadd 8014  ax-pre-mulgt0 8015  ax-pre-mulext 8016  ax-arch 8017  ax-caucvg 8018

This theorem depends on definitions:  df-bi 117  df-stab 832  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-if 3563  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-tr 4133  df-id 4329  df-po 4332  df-iso 4333  df-iord 4402  df-on 4404  df-ilim 4405  df-suc 4407  df-iom 4628  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-isom 5268  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-recs 6372  df-frec 6458  df-1o 6483  df-2o 6484  df-er 6601  df-en 6809  df-sup 7059  df-inf 7060  df-pnf 8082  df-mnf 8083  df-xr 8084  df-ltxr 8085  df-le 8086  df-sub 8218  df-neg 8219  df-reap 8621  df-ap 8628  df-div 8719  df-inn 9010  df-2 9068  df-3 9069  df-4 9070  df-n0 9269  df-xnn0 9332  df-z 9346  df-uz 9621  df-q 9713  df-rp 9748  df-fz 10103  df-fzo 10237  df-fl 10379  df-mod 10434  df-seqfrec 10559  df-exp 10650  df-cj 11026  df-re 11027  df-im 11028  df-rsqrt 11182  df-abs 11183  df-dvds 11972  df-gcd 12148  df-prm 12303  df-pc 12481

This theorem is referenced by:  pcprmpw  12530  dvdsprmpweq  12531  dvdsppwf1o  15333