Theorem pcmpt 13069

Description: Construct a function with given prime count characteristics. (Contributed by Mario Carneiro, 12-Mar-2014.)

Hypotheses

Ref	Expression
pcmpt.1	⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1))
pcmpt.2	⊢ (𝜑 → ∀𝑛 ∈ ℙ 𝐴 ∈ ℕ0)
pcmpt.3	⊢ (𝜑 → 𝑁 ∈ ℕ)
pcmpt.4	⊢ (𝜑 → 𝑃 ∈ ℙ)
pcmpt.5	⊢ (𝑛 = 𝑃 → 𝐴 = 𝐵)

Assertion

Ref	Expression
pcmpt	⊢ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑁)) = if(𝑃 ≤ 𝑁, 𝐵, 0))

Distinct variable groups:   𝐵,𝑛   𝑃,𝑛

Allowed substitution hints:   𝜑(𝑛)   𝐴(𝑛)   𝐹(𝑛)   𝑁(𝑛)

Proof of Theorem pcmpt

Dummy variables 𝑘 𝑝 𝑖 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pcmpt.3	. 2 ⊢ (𝜑 → 𝑁 ∈ ℕ)
2		fveq2 5675	. . . . . 6 ⊢ (𝑝 = 1 → (seq1( · , 𝐹)‘𝑝) = (seq1( · , 𝐹)‘1))
3	2	oveq2d 6074	. . . . 5 ⊢ (𝑝 = 1 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = (𝑃 pCnt (seq1( · , 𝐹)‘1)))
4		breq2 4118	. . . . . 6 ⊢ (𝑝 = 1 → (𝑃 ≤ 𝑝 ↔ 𝑃 ≤ 1))
5	4	ifbid 3648	. . . . 5 ⊢ (𝑝 = 1 → if(𝑃 ≤ 𝑝, 𝐵, 0) = if(𝑃 ≤ 1, 𝐵, 0))
6	3, 5	eqeq12d 2249	. . . 4 ⊢ (𝑝 = 1 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0) ↔ (𝑃 pCnt (seq1( · , 𝐹)‘1)) = if(𝑃 ≤ 1, 𝐵, 0)))
7	6	imbi2d 230	. . 3 ⊢ (𝑝 = 1 → ((𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0)) ↔ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘1)) = if(𝑃 ≤ 1, 𝐵, 0))))
8		fveq2 5675	. . . . . 6 ⊢ (𝑝 = 𝑘 → (seq1( · , 𝐹)‘𝑝) = (seq1( · , 𝐹)‘𝑘))
9	8	oveq2d 6074	. . . . 5 ⊢ (𝑝 = 𝑘 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)))
10		breq2 4118	. . . . . 6 ⊢ (𝑝 = 𝑘 → (𝑃 ≤ 𝑝 ↔ 𝑃 ≤ 𝑘))
11	10	ifbid 3648	. . . . 5 ⊢ (𝑝 = 𝑘 → if(𝑃 ≤ 𝑝, 𝐵, 0) = if(𝑃 ≤ 𝑘, 𝐵, 0))
12	9, 11	eqeq12d 2249	. . . 4 ⊢ (𝑝 = 𝑘 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0) ↔ (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0)))
13	12	imbi2d 230	. . 3 ⊢ (𝑝 = 𝑘 → ((𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0)) ↔ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0))))
14		fveq2 5675	. . . . . 6 ⊢ (𝑝 = (𝑘 + 1) → (seq1( · , 𝐹)‘𝑝) = (seq1( · , 𝐹)‘(𝑘 + 1)))
15	14	oveq2d 6074	. . . . 5 ⊢ (𝑝 = (𝑘 + 1) → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))))
16		breq2 4118	. . . . . 6 ⊢ (𝑝 = (𝑘 + 1) → (𝑃 ≤ 𝑝 ↔ 𝑃 ≤ (𝑘 + 1)))
17	16	ifbid 3648	. . . . 5 ⊢ (𝑝 = (𝑘 + 1) → if(𝑃 ≤ 𝑝, 𝐵, 0) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0))
18	15, 17	eqeq12d 2249	. . . 4 ⊢ (𝑝 = (𝑘 + 1) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0) ↔ (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0)))
19	18	imbi2d 230	. . 3 ⊢ (𝑝 = (𝑘 + 1) → ((𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0)) ↔ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0))))
20		fveq2 5675	. . . . . 6 ⊢ (𝑝 = 𝑁 → (seq1( · , 𝐹)‘𝑝) = (seq1( · , 𝐹)‘𝑁))
21	20	oveq2d 6074	. . . . 5 ⊢ (𝑝 = 𝑁 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = (𝑃 pCnt (seq1( · , 𝐹)‘𝑁)))
22		breq2 4118	. . . . . 6 ⊢ (𝑝 = 𝑁 → (𝑃 ≤ 𝑝 ↔ 𝑃 ≤ 𝑁))
23	22	ifbid 3648	. . . . 5 ⊢ (𝑝 = 𝑁 → if(𝑃 ≤ 𝑝, 𝐵, 0) = if(𝑃 ≤ 𝑁, 𝐵, 0))
24	21, 23	eqeq12d 2249	. . . 4 ⊢ (𝑝 = 𝑁 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0) ↔ (𝑃 pCnt (seq1( · , 𝐹)‘𝑁)) = if(𝑃 ≤ 𝑁, 𝐵, 0)))
25	24	imbi2d 230	. . 3 ⊢ (𝑝 = 𝑁 → ((𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0)) ↔ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑁)) = if(𝑃 ≤ 𝑁, 𝐵, 0))))
26		pcmpt.4	. . . . 5 ⊢ (𝜑 → 𝑃 ∈ ℙ)
27		pc1 13031	. . . . 5 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt 1) = 0)
28	26, 27	syl 14	. . . 4 ⊢ (𝜑 → (𝑃 pCnt 1) = 0)
29		1zzd 9624	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℤ)
30		elnnuz 9912	. . . . . . . 8 ⊢ (𝑖 ∈ ℕ ↔ 𝑖 ∈ (ℤ≥‘1))
31		simpr 110	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ) → 𝑖 ∈ ℕ)
32	31	adantr 276	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ) ∧ 𝑖 ∈ ℙ) → 𝑖 ∈ ℕ)
33		simpr 110	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ) ∧ 𝑖 ∈ ℙ) → 𝑖 ∈ ℙ)
34		pcmpt.2	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∀𝑛 ∈ ℙ 𝐴 ∈ ℕ0)
35	34	ad2antrr 488	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ) ∧ 𝑖 ∈ ℙ) → ∀𝑛 ∈ ℙ 𝐴 ∈ ℕ0)
36		nfcsb1v 3174	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑛⦋𝑖 / 𝑛⦌𝐴
37	36	nfel1 2397	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛⦋𝑖 / 𝑛⦌𝐴 ∈ ℕ0
38		csbeq1a 3150	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = 𝑖 → 𝐴 = ⦋𝑖 / 𝑛⦌𝐴)
39	38	eleq1d 2303	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑖 → (𝐴 ∈ ℕ0 ↔ ⦋𝑖 / 𝑛⦌𝐴 ∈ ℕ0))
40	37, 39	rspc 2917	. . . . . . . . . . . . 13 ⊢ (𝑖 ∈ ℙ → (∀𝑛 ∈ ℙ 𝐴 ∈ ℕ0 → ⦋𝑖 / 𝑛⦌𝐴 ∈ ℕ0))
41	33, 35, 40	sylc 62	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ) ∧ 𝑖 ∈ ℙ) → ⦋𝑖 / 𝑛⦌𝐴 ∈ ℕ0)
42	32, 41	nnexpcld 11085	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ) ∧ 𝑖 ∈ ℙ) → (𝑖↑⦋𝑖 / 𝑛⦌𝐴) ∈ ℕ)
43		1nn 9268	. . . . . . . . . . . 12 ⊢ 1 ∈ ℕ
44	43	a1i 9	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑖 ∈ ℕ) ∧ ¬ 𝑖 ∈ ℙ) → 1 ∈ ℕ)
45		prmdc 12855	. . . . . . . . . . . 12 ⊢ (𝑖 ∈ ℕ → DECID 𝑖 ∈ ℙ)
46	45	adantl 277	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ) → DECID 𝑖 ∈ ℙ)
47	42, 44, 46	ifcldadc 3656	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ) → if(𝑖 ∈ ℙ, (𝑖↑⦋𝑖 / 𝑛⦌𝐴), 1) ∈ ℕ)
48		nfcv 2386	. . . . . . . . . . 11 ⊢ Ⅎ𝑛𝑖
49	48	nfel1 2397	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛 𝑖 ∈ ℙ
50		nfcv 2386	. . . . . . . . . . . . 13 ⊢ Ⅎ𝑛↑
51	48, 50, 36	nfov 6088	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛(𝑖↑⦋𝑖 / 𝑛⦌𝐴)
52		nfcv 2386	. . . . . . . . . . . 12 ⊢ Ⅎ𝑛1
53	49, 51, 52	nfif 3655	. . . . . . . . . . 11 ⊢ Ⅎ𝑛if(𝑖 ∈ ℙ, (𝑖↑⦋𝑖 / 𝑛⦌𝐴), 1)
54		eleq1 2297	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑖 → (𝑛 ∈ ℙ ↔ 𝑖 ∈ ℙ))
55		id 19	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑖 → 𝑛 = 𝑖)
56	55, 38	oveq12d 6076	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑖 → (𝑛↑𝐴) = (𝑖↑⦋𝑖 / 𝑛⦌𝐴))
57	54, 56	ifbieq1d 3649	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑖 → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) = if(𝑖 ∈ ℙ, (𝑖↑⦋𝑖 / 𝑛⦌𝐴), 1))
58		pcmpt.1	. . . . . . . . . . 11 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1))
59	48, 53, 57, 58	fvmptf 5775	. . . . . . . . . 10 ⊢ ((𝑖 ∈ ℕ ∧ if(𝑖 ∈ ℙ, (𝑖↑⦋𝑖 / 𝑛⦌𝐴), 1) ∈ ℕ) → (𝐹‘𝑖) = if(𝑖 ∈ ℙ, (𝑖↑⦋𝑖 / 𝑛⦌𝐴), 1))
60	31, 47, 59	syl2anc 411	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ) → (𝐹‘𝑖) = if(𝑖 ∈ ℙ, (𝑖↑⦋𝑖 / 𝑛⦌𝐴), 1))
61	60, 47	eqeltrd 2311	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑖 ∈ ℕ) → (𝐹‘𝑖) ∈ ℕ)
62	30, 61	sylan2br 288	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑖 ∈ (ℤ≥‘1)) → (𝐹‘𝑖) ∈ ℕ)
63		nnmulcl 9278	. . . . . . . 8 ⊢ ((𝑖 ∈ ℕ ∧ 𝑗 ∈ ℕ) → (𝑖 · 𝑗) ∈ ℕ)
64	63	adantl 277	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑖 ∈ ℕ ∧ 𝑗 ∈ ℕ)) → (𝑖 · 𝑗) ∈ ℕ)
65	29, 62, 64	seq3-1 10851	. . . . . 6 ⊢ (𝜑 → (seq1( · , 𝐹)‘1) = (𝐹‘1))
66		1nprm 12839	. . . . . . . . . 10 ⊢ ¬ 1 ∈ ℙ
67		eleq1 2297	. . . . . . . . . 10 ⊢ (𝑛 = 1 → (𝑛 ∈ ℙ ↔ 1 ∈ ℙ))
68	66, 67	mtbiri 682	. . . . . . . . 9 ⊢ (𝑛 = 1 → ¬ 𝑛 ∈ ℙ)
69	68	iffalsed 3636	. . . . . . . 8 ⊢ (𝑛 = 1 → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) = 1)
70		1ex 8285	. . . . . . . 8 ⊢ 1 ∈ V
71	69, 58, 70	fvmpt 5759	. . . . . . 7 ⊢ (1 ∈ ℕ → (𝐹‘1) = 1)
72	43, 71	ax-mp 5	. . . . . 6 ⊢ (𝐹‘1) = 1
73	65, 72	eqtrdi 2283	. . . . 5 ⊢ (𝜑 → (seq1( · , 𝐹)‘1) = 1)
74	73	oveq2d 6074	. . . 4 ⊢ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘1)) = (𝑃 pCnt 1))
75		prmgt1 12857	. . . . . . 7 ⊢ (𝑃 ∈ ℙ → 1 < 𝑃)
76		1z 9623	. . . . . . . 8 ⊢ 1 ∈ ℤ
77		prmz 12836	. . . . . . . 8 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
78		zltnle 9643	. . . . . . . 8 ⊢ ((1 ∈ ℤ ∧ 𝑃 ∈ ℤ) → (1 < 𝑃 ↔ ¬ 𝑃 ≤ 1))
79	76, 77, 78	sylancr 414	. . . . . . 7 ⊢ (𝑃 ∈ ℙ → (1 < 𝑃 ↔ ¬ 𝑃 ≤ 1))
80	75, 79	mpbid 147	. . . . . 6 ⊢ (𝑃 ∈ ℙ → ¬ 𝑃 ≤ 1)
81	80	iffalsed 3636	. . . . 5 ⊢ (𝑃 ∈ ℙ → if(𝑃 ≤ 1, 𝐵, 0) = 0)
82	26, 81	syl 14	. . . 4 ⊢ (𝜑 → if(𝑃 ≤ 1, 𝐵, 0) = 0)
83	28, 74, 82	3eqtr4d 2277	. . 3 ⊢ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘1)) = if(𝑃 ≤ 1, 𝐵, 0))
84	26	adantr 276	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → 𝑃 ∈ ℙ)
85	58, 34	pcmptcl 13068	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐹:ℕ⟶ℕ ∧ seq1( · , 𝐹):ℕ⟶ℕ))
86	85	simpld 112	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹:ℕ⟶ℕ)
87		peano2nn 9269	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ ℕ → (𝑘 + 1) ∈ ℕ)
88		ffvelcdm 5815	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:ℕ⟶ℕ ∧ (𝑘 + 1) ∈ ℕ) → (𝐹‘(𝑘 + 1)) ∈ ℕ)
89	86, 87, 88	syl2an 289	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘(𝑘 + 1)) ∈ ℕ)
90	89	adantrr 479	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝐹‘(𝑘 + 1)) ∈ ℕ)
91	84, 90	pccld 13026	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) ∈ ℕ0)
92	91	nn0cnd 9575	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) ∈ ℂ)
93	92	addlidd 8440	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (0 + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = (𝑃 pCnt (𝐹‘(𝑘 + 1))))
94	87	ad2antrl 490	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑘 + 1) ∈ ℕ)
95	87	ad2antlr 489	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 + 1) ∈ ℙ) → (𝑘 + 1) ∈ ℕ)
96		simpr 110	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 + 1) ∈ ℙ) → (𝑘 + 1) ∈ ℙ)
97	34	ad2antrr 488	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 + 1) ∈ ℙ) → ∀𝑛 ∈ ℙ 𝐴 ∈ ℕ0)
98		nfcsb1v 3174	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑛⦋(𝑘 + 1) / 𝑛⦌𝐴
99	98	nfel1 2397	. . . . . . . . . . . . . . . . . 18 ⊢ Ⅎ𝑛⦋(𝑘 + 1) / 𝑛⦌𝐴 ∈ ℕ0
100		csbeq1a 3150	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = (𝑘 + 1) → 𝐴 = ⦋(𝑘 + 1) / 𝑛⦌𝐴)
101	100	eleq1d 2303	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = (𝑘 + 1) → (𝐴 ∈ ℕ0 ↔ ⦋(𝑘 + 1) / 𝑛⦌𝐴 ∈ ℕ0))
102	99, 101	rspc 2917	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 + 1) ∈ ℙ → (∀𝑛 ∈ ℙ 𝐴 ∈ ℕ0 → ⦋(𝑘 + 1) / 𝑛⦌𝐴 ∈ ℕ0))
103	96, 97, 102	sylc 62	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 + 1) ∈ ℙ) → ⦋(𝑘 + 1) / 𝑛⦌𝐴 ∈ ℕ0)
104	95, 103	nnexpcld 11085	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑘 + 1) ∈ ℙ) → ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴) ∈ ℕ)
105	43	a1i 9	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ ¬ (𝑘 + 1) ∈ ℙ) → 1 ∈ ℕ)
106	87	adantl 277	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑘 + 1) ∈ ℕ)
107		prmdc 12855	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 + 1) ∈ ℕ → DECID (𝑘 + 1) ∈ ℙ)
108	106, 107	syl 14	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → DECID (𝑘 + 1) ∈ ℙ)
109	104, 105, 108	ifcldadc 3656	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1) ∈ ℕ)
110	109	adantrr 479	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1) ∈ ℕ)
111		nfcv 2386	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛(𝑘 + 1)
112		nfv 1577	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑛(𝑘 + 1) ∈ ℙ
113	111, 50, 98	nfov 6088	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑛((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴)
114	112, 113, 52	nfif 3655	. . . . . . . . . . . . . 14 ⊢ Ⅎ𝑛if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1)
115		eleq1 2297	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = (𝑘 + 1) → (𝑛 ∈ ℙ ↔ (𝑘 + 1) ∈ ℙ))
116		id 19	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = (𝑘 + 1) → 𝑛 = (𝑘 + 1))
117	116, 100	oveq12d 6076	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = (𝑘 + 1) → (𝑛↑𝐴) = ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴))
118	115, 117	ifbieq1d 3649	. . . . . . . . . . . . . 14 ⊢ (𝑛 = (𝑘 + 1) → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) = if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1))
119	111, 114, 118, 58	fvmptf 5775	. . . . . . . . . . . . 13 ⊢ (((𝑘 + 1) ∈ ℕ ∧ if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1) ∈ ℕ) → (𝐹‘(𝑘 + 1)) = if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1))
120	94, 110, 119	syl2anc 411	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝐹‘(𝑘 + 1)) = if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1))
121		simprr 533	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑘 + 1) = 𝑃)
122	121, 84	eqeltrd 2311	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑘 + 1) ∈ ℙ)
123	122	iftrued 3633	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1) = ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴))
124	121	csbeq1d 3148	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ⦋(𝑘 + 1) / 𝑛⦌𝐴 = ⦋𝑃 / 𝑛⦌𝐴)
125		nfcvd 2387	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ ℙ → Ⅎ𝑛𝐵)
126		pcmpt.5	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑃 → 𝐴 = 𝐵)
127	125, 126	csbiegf 3185	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ ℙ → ⦋𝑃 / 𝑛⦌𝐴 = 𝐵)
128	84, 127	syl 14	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ⦋𝑃 / 𝑛⦌𝐴 = 𝐵)
129	124, 128	eqtrd 2267	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ⦋(𝑘 + 1) / 𝑛⦌𝐴 = 𝐵)
130	121, 129	oveq12d 6076	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴) = (𝑃↑𝐵))
131	120, 123, 130	3eqtrd 2271	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝐹‘(𝑘 + 1)) = (𝑃↑𝐵))
132	131	oveq2d 6074	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) = (𝑃 pCnt (𝑃↑𝐵)))
133	126	eleq1d 2303	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑃 → (𝐴 ∈ ℕ0 ↔ 𝐵 ∈ ℕ0))
134	133	rspcv 2919	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℙ → (∀𝑛 ∈ ℙ 𝐴 ∈ ℕ0 → 𝐵 ∈ ℕ0))
135	26, 34, 134	sylc 62	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵 ∈ ℕ0)
136	135	adantr 276	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → 𝐵 ∈ ℕ0)
137		pcidlem 13049	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℙ ∧ 𝐵 ∈ ℕ0) → (𝑃 pCnt (𝑃↑𝐵)) = 𝐵)
138	26, 136, 137	syl2an2r 599	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑃 pCnt (𝑃↑𝐵)) = 𝐵)
139	93, 132, 138	3eqtrd 2271	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (0 + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = 𝐵)
140		oveq1 6065	. . . . . . . . . 10 ⊢ ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = 0 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = (0 + (𝑃 pCnt (𝐹‘(𝑘 + 1)))))
141	140	eqeq1d 2243	. . . . . . . . 9 ⊢ ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = 0 → (((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = 𝐵 ↔ (0 + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = 𝐵))
142	139, 141	syl5ibrcom 157	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = 0 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = 𝐵))
143		nnre 9264	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℝ)
144	143	ltp1d 9224	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℕ → 𝑘 < (𝑘 + 1))
145		nnz 9616	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℤ)
146	87	nnzd 9720	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℕ → (𝑘 + 1) ∈ ℤ)
147		zltnle 9643	. . . . . . . . . . . . . 14 ⊢ ((𝑘 ∈ ℤ ∧ (𝑘 + 1) ∈ ℤ) → (𝑘 < (𝑘 + 1) ↔ ¬ (𝑘 + 1) ≤ 𝑘))
148	145, 146, 147	syl2anc 411	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℕ → (𝑘 < (𝑘 + 1) ↔ ¬ (𝑘 + 1) ≤ 𝑘))
149	144, 148	mpbid 147	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ℕ → ¬ (𝑘 + 1) ≤ 𝑘)
150	149	ad2antrl 490	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ¬ (𝑘 + 1) ≤ 𝑘)
151	121	breq1d 4124	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ((𝑘 + 1) ≤ 𝑘 ↔ 𝑃 ≤ 𝑘))
152	150, 151	mtbid 679	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ¬ 𝑃 ≤ 𝑘)
153	152	iffalsed 3636	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → if(𝑃 ≤ 𝑘, 𝐵, 0) = 0)
154	153	eqeq2d 2246	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) ↔ (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = 0))
155		simpr 110	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ)
156		nnuz 9911	. . . . . . . . . . . . . 14 ⊢ ℕ = (ℤ≥‘1)
157	155, 156	eleqtrdi 2327	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ (ℤ≥‘1))
158	62	adantlr 477	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ 𝑖 ∈ (ℤ≥‘1)) → (𝐹‘𝑖) ∈ ℕ)
159	63	adantl 277	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑘 ∈ ℕ) ∧ (𝑖 ∈ ℕ ∧ 𝑗 ∈ ℕ)) → (𝑖 · 𝑗) ∈ ℕ)
160	157, 158, 159	seq3p1 10854	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (seq1( · , 𝐹)‘(𝑘 + 1)) = ((seq1( · , 𝐹)‘𝑘) · (𝐹‘(𝑘 + 1))))
161	160	oveq2d 6074	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = (𝑃 pCnt ((seq1( · , 𝐹)‘𝑘) · (𝐹‘(𝑘 + 1)))))
162	26	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑃 ∈ ℙ)
163	85	simprd 114	. . . . . . . . . . . . . 14 ⊢ (𝜑 → seq1( · , 𝐹):ℕ⟶ℕ)
164	163	ffvelcdmda 5817	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (seq1( · , 𝐹)‘𝑘) ∈ ℕ)
165		nnz 9616	. . . . . . . . . . . . . 14 ⊢ ((seq1( · , 𝐹)‘𝑘) ∈ ℕ → (seq1( · , 𝐹)‘𝑘) ∈ ℤ)
166		nnne0 9285	. . . . . . . . . . . . . 14 ⊢ ((seq1( · , 𝐹)‘𝑘) ∈ ℕ → (seq1( · , 𝐹)‘𝑘) ≠ 0)
167	165, 166	jca 306	. . . . . . . . . . . . 13 ⊢ ((seq1( · , 𝐹)‘𝑘) ∈ ℕ → ((seq1( · , 𝐹)‘𝑘) ∈ ℤ ∧ (seq1( · , 𝐹)‘𝑘) ≠ 0))
168	164, 167	syl 14	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((seq1( · , 𝐹)‘𝑘) ∈ ℤ ∧ (seq1( · , 𝐹)‘𝑘) ≠ 0))
169		nnz 9616	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘(𝑘 + 1)) ∈ ℕ → (𝐹‘(𝑘 + 1)) ∈ ℤ)
170		nnne0 9285	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘(𝑘 + 1)) ∈ ℕ → (𝐹‘(𝑘 + 1)) ≠ 0)
171	169, 170	jca 306	. . . . . . . . . . . . 13 ⊢ ((𝐹‘(𝑘 + 1)) ∈ ℕ → ((𝐹‘(𝑘 + 1)) ∈ ℤ ∧ (𝐹‘(𝑘 + 1)) ≠ 0))
172	89, 171	syl 14	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐹‘(𝑘 + 1)) ∈ ℤ ∧ (𝐹‘(𝑘 + 1)) ≠ 0))
173		pcmul 13027	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ ℙ ∧ ((seq1( · , 𝐹)‘𝑘) ∈ ℤ ∧ (seq1( · , 𝐹)‘𝑘) ≠ 0) ∧ ((𝐹‘(𝑘 + 1)) ∈ ℤ ∧ (𝐹‘(𝑘 + 1)) ≠ 0)) → (𝑃 pCnt ((seq1( · , 𝐹)‘𝑘) · (𝐹‘(𝑘 + 1)))) = ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))))
174	162, 168, 172, 173	syl3anc 1274	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑃 pCnt ((seq1( · , 𝐹)‘𝑘) · (𝐹‘(𝑘 + 1)))) = ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))))
175	161, 174	eqtrd 2267	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))))
176	175	adantrr 479	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))))
177		prmnn 12835	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
178	26, 177	syl 14	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑃 ∈ ℕ)
179	178	nnred 9270	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑃 ∈ ℝ)
180	179	adantr 276	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → 𝑃 ∈ ℝ)
181	180	leidd 8806	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → 𝑃 ≤ 𝑃)
182	181, 121	breqtrrd 4142	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → 𝑃 ≤ (𝑘 + 1))
183	182	iftrued 3633	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → if(𝑃 ≤ (𝑘 + 1), 𝐵, 0) = 𝐵)
184	176, 183	eqeq12d 2249	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0) ↔ ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = 𝐵))
185	142, 154, 184	3imtr4d 203	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0)))
186	185	expr 375	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝑘 + 1) = 𝑃 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0))))
187	175	adantrr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))))
188		simplrr 538	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝑘 + 1) ≠ 𝑃)
189	188	necomd 2500	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → 𝑃 ≠ (𝑘 + 1))
190	26	ad2antrr 488	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → 𝑃 ∈ ℙ)
191		simpr 110	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝑘 + 1) ∈ ℙ)
192	34	ad2antrr 488	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → ∀𝑛 ∈ ℙ 𝐴 ∈ ℕ0)
193	191, 192, 102	sylc 62	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → ⦋(𝑘 + 1) / 𝑛⦌𝐴 ∈ ℕ0)
194		prmdvdsexpr 12875	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑃 ∈ ℙ ∧ (𝑘 + 1) ∈ ℙ ∧ ⦋(𝑘 + 1) / 𝑛⦌𝐴 ∈ ℕ0) → (𝑃 ∥ ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴) → 𝑃 = (𝑘 + 1)))
195	190, 191, 193, 194	syl3anc 1274	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝑃 ∥ ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴) → 𝑃 = (𝑘 + 1)))
196	195	necon3ad 2456	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝑃 ≠ (𝑘 + 1) → ¬ 𝑃 ∥ ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴)))
197	189, 196	mpd 13	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → ¬ 𝑃 ∥ ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴))
198	87	ad2antrl 490	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑘 + 1) ∈ ℕ)
199	109	adantrr 479	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1) ∈ ℕ)
200	198, 199, 119	syl2anc 411	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝐹‘(𝑘 + 1)) = if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1))
201		iftrue 3631	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 + 1) ∈ ℙ → if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1) = ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴))
202	200, 201	sylan9eq 2287	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝐹‘(𝑘 + 1)) = ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴))
203	202	breq2d 4126	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝑃 ∥ (𝐹‘(𝑘 + 1)) ↔ 𝑃 ∥ ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴)))
204	197, 203	mtbird 680	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → ¬ 𝑃 ∥ (𝐹‘(𝑘 + 1)))
205	86, 198, 88	syl2an2r 599	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝐹‘(𝑘 + 1)) ∈ ℕ)
206	205	adantr 276	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝐹‘(𝑘 + 1)) ∈ ℕ)
207		pceq0 13048	. . . . . . . . . . . . . 14 ⊢ ((𝑃 ∈ ℙ ∧ (𝐹‘(𝑘 + 1)) ∈ ℕ) → ((𝑃 pCnt (𝐹‘(𝑘 + 1))) = 0 ↔ ¬ 𝑃 ∥ (𝐹‘(𝑘 + 1))))
208	190, 206, 207	syl2anc 411	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → ((𝑃 pCnt (𝐹‘(𝑘 + 1))) = 0 ↔ ¬ 𝑃 ∥ (𝐹‘(𝑘 + 1))))
209	204, 208	mpbird 167	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) = 0)
210		iffalse 3634	. . . . . . . . . . . . . . 15 ⊢ (¬ (𝑘 + 1) ∈ ℙ → if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1) = 1)
211	200, 210	sylan9eq 2287	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ ¬ (𝑘 + 1) ∈ ℙ) → (𝐹‘(𝑘 + 1)) = 1)
212	211	oveq2d 6074	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ ¬ (𝑘 + 1) ∈ ℙ) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) = (𝑃 pCnt 1))
213	28	ad2antrr 488	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ ¬ (𝑘 + 1) ∈ ℙ) → (𝑃 pCnt 1) = 0)
214	212, 213	eqtrd 2267	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ ¬ (𝑘 + 1) ∈ ℙ) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) = 0)
215		exmiddc 844	. . . . . . . . . . . . 13 ⊢ (DECID (𝑘 + 1) ∈ ℙ → ((𝑘 + 1) ∈ ℙ ∨ ¬ (𝑘 + 1) ∈ ℙ))
216	198, 107, 215	3syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → ((𝑘 + 1) ∈ ℙ ∨ ¬ (𝑘 + 1) ∈ ℙ))
217	209, 214, 216	mpjaodan 806	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) = 0)
218	217	oveq2d 6074	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + 0))
219	26	adantr 276	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → 𝑃 ∈ ℙ)
220	164	adantrr 479	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (seq1( · , 𝐹)‘𝑘) ∈ ℕ)
221	219, 220	pccld 13026	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) ∈ ℕ0)
222	221	nn0cnd 9575	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) ∈ ℂ)
223	222	addridd 8439	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + 0) = (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)))
224	187, 218, 223	3eqtrd 2271	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)))
225	219, 77	syl 14	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → 𝑃 ∈ ℤ)
226	146	ad2antrl 490	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑘 + 1) ∈ ℤ)
227		zltlen 9677	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ ℤ ∧ (𝑘 + 1) ∈ ℤ) → (𝑃 < (𝑘 + 1) ↔ (𝑃 ≤ (𝑘 + 1) ∧ (𝑘 + 1) ≠ 𝑃)))
228	225, 226, 227	syl2anc 411	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 < (𝑘 + 1) ↔ (𝑃 ≤ (𝑘 + 1) ∧ (𝑘 + 1) ≠ 𝑃)))
229		simprl 531	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → 𝑘 ∈ ℕ)
230		nnleltp1 9657	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ) → (𝑃 ≤ 𝑘 ↔ 𝑃 < (𝑘 + 1)))
231	178, 229, 230	syl2an2r 599	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 ≤ 𝑘 ↔ 𝑃 < (𝑘 + 1)))
232		simprr 533	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑘 + 1) ≠ 𝑃)
233	232	biantrud 304	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 ≤ (𝑘 + 1) ↔ (𝑃 ≤ (𝑘 + 1) ∧ (𝑘 + 1) ≠ 𝑃)))
234	228, 231, 233	3bitr4rd 221	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 ≤ (𝑘 + 1) ↔ 𝑃 ≤ 𝑘))
235	234	ifbid 3648	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → if(𝑃 ≤ (𝑘 + 1), 𝐵, 0) = if(𝑃 ≤ 𝑘, 𝐵, 0))
236	224, 235	eqeq12d 2249	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0) ↔ (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0)))
237	236	biimprd 158	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0)))
238	237	expr 375	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝑘 + 1) ≠ 𝑃 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0))))
239	106	nnzd 9720	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑘 + 1) ∈ ℤ)
240	162, 77	syl 14	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑃 ∈ ℤ)
241		zdceq 9673	. . . . . . . 8 ⊢ (((𝑘 + 1) ∈ ℤ ∧ 𝑃 ∈ ℤ) → DECID (𝑘 + 1) = 𝑃)
242	239, 240, 241	syl2anc 411	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → DECID (𝑘 + 1) = 𝑃)
243		dcne 2425	. . . . . . 7 ⊢ (DECID (𝑘 + 1) = 𝑃 ↔ ((𝑘 + 1) = 𝑃 ∨ (𝑘 + 1) ≠ 𝑃))
244	242, 243	sylib 122	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝑘 + 1) = 𝑃 ∨ (𝑘 + 1) ≠ 𝑃))
245	186, 238, 244	mpjaod 726	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0)))
246	245	expcom 116	. . . 4 ⊢ (𝑘 ∈ ℕ → (𝜑 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0))))
247	246	a2d 26	. . 3 ⊢ (𝑘 ∈ ℕ → ((𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0)) → (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0))))
248	7, 13, 19, 25, 83, 247	nnind 9273	. 2 ⊢ (𝑁 ∈ ℕ → (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑁)) = if(𝑃 ≤ 𝑁, 𝐵, 0)))
249	1, 248	mpcom 36	1 ⊢ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑁)) = if(𝑃 ≤ 𝑁, 𝐵, 0))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 104   ↔ wb 105   ∨ wo 716  DECID wdc 842   = wceq 1398   ∈ wcel 2205   ≠ wne 2414  ∀wral 2522  ⦋csb 3141  ifcif 3624   class class class wbr 4114   ↦ cmpt 4176  ⟶wf 5353  ‘cfv 5357  (class class class)co 6058  ℝcr 8142  0cc0 8143  1c1 8144   + caddc 8146   · cmul 8148   < clt 8324   ≤ cle 8325  ℕcn 9257  ℕ₀cn0 9516  ℤcz 9597  ℤ_≥cuz 9874  seqcseq 10836  ↑cexp 10927   ∥ cdvds 12501  ℙcprime 12832   pCnt cpc 13010

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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-mulrcl 8242  ax-addcom 8243  ax-mulcom 8244  ax-addass 8245  ax-mulass 8246  ax-distr 8247  ax-i2m1 8248  ax-0lt1 8249  ax-1rid 8250  ax-0id 8251  ax-rnegex 8252  ax-precex 8253  ax-cnre 8254  ax-pre-ltirr 8255  ax-pre-ltwlin 8256  ax-pre-lttrn 8257  ax-pre-apti 8258  ax-pre-ltadd 8259  ax-pre-mulgt0 8260  ax-pre-mulext 8261  ax-arch 8262  ax-caucvg 8263

This theorem depends on definitions:  df-bi 117  df-stab 839  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-if 3625  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-ilim 4495  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-isom 5366  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-frec 6635  df-1o 6660  df-2o 6661  df-er 6780  df-en 6989  df-fin 6991  df-sup 7288  df-inf 7289  df-pnf 8326  df-mnf 8327  df-xr 8328  df-ltxr 8329  df-le 8330  df-sub 8463  df-neg 8464  df-reap 8867  df-ap 8874  df-div 8967  df-inn 9258  df-2 9316  df-3 9317  df-4 9318  df-n0 9517  df-z 9598  df-uz 9875  df-q 9973  df-rp 10008  df-fz 10365  df-fzo 10502  df-fl 10657  df-mod 10712  df-seqfrec 10837  df-exp 10928  df-cj 11555  df-re 11556  df-im 11557  df-rsqrt 11711  df-abs 11712  df-dvds 12502  df-gcd 12678  df-prm 12833  df-pc 13011

This theorem is referenced by:  pcmpt2  13070  pcprod  13072  1arithlem4  13092