pcmpt - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > pcmpt		Structured version Visualization version GIF version

Theorem pcmpt 16900

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	⊢ (𝜑 → ∀𝑛 ∈ ℙ 𝐴 ∈ ℕ₀)
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 6852	. . . . . 6 ⊢ (𝑝 = 1 → (seq1( · , 𝐹)‘𝑝) = (seq1( · , 𝐹)‘1))
3	2	oveq2d 7397	. . . . 5 ⊢ (𝑝 = 1 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = (𝑃 pCnt (seq1( · , 𝐹)‘1)))
4		breq2 5094	. . . . . 6 ⊢ (𝑝 = 1 → (𝑃 ≤ 𝑝 ↔ 𝑃 ≤ 1))
5	4	ifbid 4494	. . . . 5 ⊢ (𝑝 = 1 → if(𝑃 ≤ 𝑝, 𝐵, 0) = if(𝑃 ≤ 1, 𝐵, 0))
6	3, 5	eqeq12d 2768	. . . 4 ⊢ (𝑝 = 1 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0) ↔ (𝑃 pCnt (seq1( · , 𝐹)‘1)) = if(𝑃 ≤ 1, 𝐵, 0)))
7	6	imbi2d 342	. . 3 ⊢ (𝑝 = 1 → ((𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0)) ↔ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘1)) = if(𝑃 ≤ 1, 𝐵, 0))))
8		fveq2 6852	. . . . . 6 ⊢ (𝑝 = 𝑘 → (seq1( · , 𝐹)‘𝑝) = (seq1( · , 𝐹)‘𝑘))
9	8	oveq2d 7397	. . . . 5 ⊢ (𝑝 = 𝑘 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)))
10		breq2 5094	. . . . . 6 ⊢ (𝑝 = 𝑘 → (𝑃 ≤ 𝑝 ↔ 𝑃 ≤ 𝑘))
11	10	ifbid 4494	. . . . 5 ⊢ (𝑝 = 𝑘 → if(𝑃 ≤ 𝑝, 𝐵, 0) = if(𝑃 ≤ 𝑘, 𝐵, 0))
12	9, 11	eqeq12d 2768	. . . 4 ⊢ (𝑝 = 𝑘 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0) ↔ (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0)))
13	12	imbi2d 342	. . 3 ⊢ (𝑝 = 𝑘 → ((𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0)) ↔ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0))))
14		fveq2 6852	. . . . . 6 ⊢ (𝑝 = (𝑘 + 1) → (seq1( · , 𝐹)‘𝑝) = (seq1( · , 𝐹)‘(𝑘 + 1)))
15	14	oveq2d 7397	. . . . 5 ⊢ (𝑝 = (𝑘 + 1) → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))))
16		breq2 5094	. . . . . 6 ⊢ (𝑝 = (𝑘 + 1) → (𝑃 ≤ 𝑝 ↔ 𝑃 ≤ (𝑘 + 1)))
17	16	ifbid 4494	. . . . 5 ⊢ (𝑝 = (𝑘 + 1) → if(𝑃 ≤ 𝑝, 𝐵, 0) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0))
18	15, 17	eqeq12d 2768	. . . 4 ⊢ (𝑝 = (𝑘 + 1) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0) ↔ (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0)))
19	18	imbi2d 342	. . 3 ⊢ (𝑝 = (𝑘 + 1) → ((𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0)) ↔ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0))))
20		fveq2 6852	. . . . . 6 ⊢ (𝑝 = 𝑁 → (seq1( · , 𝐹)‘𝑝) = (seq1( · , 𝐹)‘𝑁))
21	20	oveq2d 7397	. . . . 5 ⊢ (𝑝 = 𝑁 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = (𝑃 pCnt (seq1( · , 𝐹)‘𝑁)))
22		breq2 5094	. . . . . 6 ⊢ (𝑝 = 𝑁 → (𝑃 ≤ 𝑝 ↔ 𝑃 ≤ 𝑁))
23	22	ifbid 4494	. . . . 5 ⊢ (𝑝 = 𝑁 → if(𝑃 ≤ 𝑝, 𝐵, 0) = if(𝑃 ≤ 𝑁, 𝐵, 0))
24	21, 23	eqeq12d 2768	. . . 4 ⊢ (𝑝 = 𝑁 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0) ↔ (𝑃 pCnt (seq1( · , 𝐹)‘𝑁)) = if(𝑃 ≤ 𝑁, 𝐵, 0)))
25	24	imbi2d 342	. . 3 ⊢ (𝑝 = 𝑁 → ((𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑝)) = if(𝑃 ≤ 𝑝, 𝐵, 0)) ↔ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑁)) = if(𝑃 ≤ 𝑁, 𝐵, 0))))
26		pcmpt.4	. . . 4 ⊢ (𝜑 → 𝑃 ∈ ℙ)
27		1z 12587	. . . . . . . . 9 ⊢ 1 ∈ ℤ
28		seq1 14013	. . . . . . . . 9 ⊢ (1 ∈ ℤ → (seq1( · , 𝐹)‘1) = (𝐹‘1))
29	27, 28	ax-mp 5	. . . . . . . 8 ⊢ (seq1( · , 𝐹)‘1) = (𝐹‘1)
30		1nn 12207	. . . . . . . . 9 ⊢ 1 ∈ ℕ
31		1nprm 16685	. . . . . . . . . . . 12 ⊢ ¬ 1 ∈ ℙ
32		eleq1 2840	. . . . . . . . . . . 12 ⊢ (𝑛 = 1 → (𝑛 ∈ ℙ ↔ 1 ∈ ℙ))
33	31, 32	mtbiri 329	. . . . . . . . . . 11 ⊢ (𝑛 = 1 → ¬ 𝑛 ∈ ℙ)
34	33	iffalsed 4481	. . . . . . . . . 10 ⊢ (𝑛 = 1 → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) = 1)
35		pcmpt.1	. . . . . . . . . 10 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1))
36		1ex 11162	. . . . . . . . . 10 ⊢ 1 ∈ V
37	34, 35, 36	fvmpt 6960	. . . . . . . . 9 ⊢ (1 ∈ ℕ → (𝐹‘1) = 1)
38	30, 37	ax-mp 5	. . . . . . . 8 ⊢ (𝐹‘1) = 1
39	29, 38	eqtri 2775	. . . . . . 7 ⊢ (seq1( · , 𝐹)‘1) = 1
40	39	oveq2i 7392	. . . . . 6 ⊢ (𝑃 pCnt (seq1( · , 𝐹)‘1)) = (𝑃 pCnt 1)
41		pc1 16863	. . . . . 6 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt 1) = 0)
42	40, 41	eqtrid 2799	. . . . 5 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt (seq1( · , 𝐹)‘1)) = 0)
43		prmgt1 16704	. . . . . . 7 ⊢ (𝑃 ∈ ℙ → 1 < 𝑃)
44		1re 11167	. . . . . . . 8 ⊢ 1 ∈ ℝ
45		prmuz2 16702	. . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ_≥‘2))
46		eluzelre 12836	. . . . . . . . 9 ⊢ (𝑃 ∈ (ℤ_≥‘2) → 𝑃 ∈ ℝ)
47	45, 46	syl 17	. . . . . . . 8 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℝ)
48		ltnle 11248	. . . . . . . 8 ⊢ ((1 ∈ ℝ ∧ 𝑃 ∈ ℝ) → (1 < 𝑃 ↔ ¬ 𝑃 ≤ 1))
49	44, 47, 48	sylancr 595	. . . . . . 7 ⊢ (𝑃 ∈ ℙ → (1 < 𝑃 ↔ ¬ 𝑃 ≤ 1))
50	43, 49	mpbid 234	. . . . . 6 ⊢ (𝑃 ∈ ℙ → ¬ 𝑃 ≤ 1)
51	50	iffalsed 4481	. . . . 5 ⊢ (𝑃 ∈ ℙ → if(𝑃 ≤ 1, 𝐵, 0) = 0)
52	42, 51	eqtr4d 2790	. . . 4 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt (seq1( · , 𝐹)‘1)) = if(𝑃 ≤ 1, 𝐵, 0))
53	26, 52	syl 17	. . 3 ⊢ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘1)) = if(𝑃 ≤ 1, 𝐵, 0))
54	26	adantr 483	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → 𝑃 ∈ ℙ)
55		pcmpt.2	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → ∀𝑛 ∈ ℙ 𝐴 ∈ ℕ₀)
56	35, 55	pcmptcl 16899	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐹:ℕ⟶ℕ ∧ seq1( · , 𝐹):ℕ⟶ℕ))
57	56	simpld 497	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝐹:ℕ⟶ℕ)
58		peano2nn 12208	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ ℕ → (𝑘 + 1) ∈ ℕ)
59		ffvelcdm 7047	. . . . . . . . . . . . . . 15 ⊢ ((𝐹:ℕ⟶ℕ ∧ (𝑘 + 1) ∈ ℕ) → (𝐹‘(𝑘 + 1)) ∈ ℕ)
60	57, 58, 59	syl2an 604	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐹‘(𝑘 + 1)) ∈ ℕ)
61	60	adantrr 725	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝐹‘(𝑘 + 1)) ∈ ℕ)
62	54, 61	pccld 16858	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) ∈ ℕ₀)
63	62	nn0cnd 12530	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) ∈ ℂ)
64	63	addlidd 11370	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (0 + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = (𝑃 pCnt (𝐹‘(𝑘 + 1))))
65	58	ad2antrl 736	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑘 + 1) ∈ ℕ)
66		ovex 7414	. . . . . . . . . . . . . . 15 ⊢ (𝑛↑𝐴) ∈ V
67	66, 36	ifex 4521	. . . . . . . . . . . . . 14 ⊢ if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ V
68	67	csbex 5251	. . . . . . . . . . . . 13 ⊢ ⦋(𝑘 + 1) / 𝑛⦌if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ V
69	35	fvmpts 6964	. . . . . . . . . . . . . 14 ⊢ (((𝑘 + 1) ∈ ℕ ∧ ⦋(𝑘 + 1) / 𝑛⦌if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ V) → (𝐹‘(𝑘 + 1)) = ⦋(𝑘 + 1) / 𝑛⦌if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1))
70		ovex 7414	. . . . . . . . . . . . . . 15 ⊢ (𝑘 + 1) ∈ V
71		nfv 1924	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑛(𝑘 + 1) ∈ ℙ
72		nfcv 2914	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑛(𝑘 + 1)
73		nfcv 2914	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑛↑
74		nfcsb1v 3867	. . . . . . . . . . . . . . . . 17 ⊢ Ⅎ𝑛⦋(𝑘 + 1) / 𝑛⦌𝐴
75	72, 73, 74	nfov 7411	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑛((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴)
76		nfcv 2914	. . . . . . . . . . . . . . . 16 ⊢ Ⅎ𝑛1
77	71, 75, 76	nfif 4501	. . . . . . . . . . . . . . 15 ⊢ Ⅎ𝑛if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1)
78		eleq1 2840	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = (𝑘 + 1) → (𝑛 ∈ ℙ ↔ (𝑘 + 1) ∈ ℙ))
79		id 22	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = (𝑘 + 1) → 𝑛 = (𝑘 + 1))
80		csbeq1a 3857	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = (𝑘 + 1) → 𝐴 = ⦋(𝑘 + 1) / 𝑛⦌𝐴)
81	79, 80	oveq12d 7399	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = (𝑘 + 1) → (𝑛↑𝐴) = ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴))
82	78, 81	ifbieq1d 4495	. . . . . . . . . . . . . . 15 ⊢ (𝑛 = (𝑘 + 1) → if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) = if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1))
83	70, 77, 82	csbief 3877	. . . . . . . . . . . . . 14 ⊢ ⦋(𝑘 + 1) / 𝑛⦌if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) = if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1)
84	69, 83	eqtrdi 2803	. . . . . . . . . . . . 13 ⊢ (((𝑘 + 1) ∈ ℕ ∧ ⦋(𝑘 + 1) / 𝑛⦌if(𝑛 ∈ ℙ, (𝑛↑𝐴), 1) ∈ V) → (𝐹‘(𝑘 + 1)) = if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1))
85	65, 68, 84	sylancl 594	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝐹‘(𝑘 + 1)) = if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1))
86		simprr 780	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑘 + 1) = 𝑃)
87	86, 54	eqeltrd 2852	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑘 + 1) ∈ ℙ)
88	87	iftrued 4478	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1) = ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴))
89	86	csbeq1d 3847	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ⦋(𝑘 + 1) / 𝑛⦌𝐴 = ⦋𝑃 / 𝑛⦌𝐴)
90		nfcvd 2915	. . . . . . . . . . . . . . . 16 ⊢ (𝑃 ∈ ℙ → Ⅎ𝑛𝐵)
91		pcmpt.5	. . . . . . . . . . . . . . . 16 ⊢ (𝑛 = 𝑃 → 𝐴 = 𝐵)
92	90, 91	csbiegf 3876	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ ℙ → ⦋𝑃 / 𝑛⦌𝐴 = 𝐵)
93	54, 92	syl 17	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ⦋𝑃 / 𝑛⦌𝐴 = 𝐵)
94	89, 93	eqtrd 2787	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ⦋(𝑘 + 1) / 𝑛⦌𝐴 = 𝐵)
95	86, 94	oveq12d 7399	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴) = (𝑃↑𝐵))
96	85, 88, 95	3eqtrd 2791	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝐹‘(𝑘 + 1)) = (𝑃↑𝐵))
97	96	oveq2d 7397	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) = (𝑃 pCnt (𝑃↑𝐵)))
98	91	eleq1d 2837	. . . . . . . . . . . . . 14 ⊢ (𝑛 = 𝑃 → (𝐴 ∈ ℕ₀ ↔ 𝐵 ∈ ℕ₀))
99	98	rspcv 3568	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℙ → (∀𝑛 ∈ ℙ 𝐴 ∈ ℕ₀ → 𝐵 ∈ ℕ₀))
100	26, 55, 99	sylc 65	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐵 ∈ ℕ₀)
101	100	adantr 483	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → 𝐵 ∈ ℕ₀)
102		pcidlem 16880	. . . . . . . . . . 11 ⊢ ((𝑃 ∈ ℙ ∧ 𝐵 ∈ ℕ₀) → (𝑃 pCnt (𝑃↑𝐵)) = 𝐵)
103	54, 101, 102	syl2anc 592	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑃 pCnt (𝑃↑𝐵)) = 𝐵)
104	64, 97, 103	3eqtrd 2791	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (0 + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = 𝐵)
105		oveq1 7388	. . . . . . . . . 10 ⊢ ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = 0 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = (0 + (𝑃 pCnt (𝐹‘(𝑘 + 1)))))
106	105	eqeq1d 2754	. . . . . . . . 9 ⊢ ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = 0 → (((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = 𝐵 ↔ (0 + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = 𝐵))
107	104, 106	syl5ibrcom 249	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = 0 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = 𝐵))
108		nnre 12203	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℝ)
109	108	ad2antrl 736	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → 𝑘 ∈ ℝ)
110		ltp1 12017	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℝ → 𝑘 < (𝑘 + 1))
111		peano2re 11342	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ℝ → (𝑘 + 1) ∈ ℝ)
112		ltnle 11248	. . . . . . . . . . . . . 14 ⊢ ((𝑘 ∈ ℝ ∧ (𝑘 + 1) ∈ ℝ) → (𝑘 < (𝑘 + 1) ↔ ¬ (𝑘 + 1) ≤ 𝑘))
113	111, 112	mpdan 695	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ ℝ → (𝑘 < (𝑘 + 1) ↔ ¬ (𝑘 + 1) ≤ 𝑘))
114	110, 113	mpbid 234	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ ℝ → ¬ (𝑘 + 1) ≤ 𝑘)
115	109, 114	syl 17	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ¬ (𝑘 + 1) ≤ 𝑘)
116	86	breq1d 5100	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ((𝑘 + 1) ≤ 𝑘 ↔ 𝑃 ≤ 𝑘))
117	115, 116	mtbid 326	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ¬ 𝑃 ≤ 𝑘)
118	117	iffalsed 4481	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → if(𝑃 ≤ 𝑘, 𝐵, 0) = 0)
119	118	eqeq2d 2763	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) ↔ (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = 0))
120		simpr 487	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ)
121		nnuz 12864	. . . . . . . . . . . . . 14 ⊢ ℕ = (ℤ_≥‘1)
122	120, 121	eleqtrdi 2862	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ (ℤ_≥‘1))
123		seqp1 14015	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (ℤ_≥‘1) → (seq1( · , 𝐹)‘(𝑘 + 1)) = ((seq1( · , 𝐹)‘𝑘) · (𝐹‘(𝑘 + 1))))
124	122, 123	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (seq1( · , 𝐹)‘(𝑘 + 1)) = ((seq1( · , 𝐹)‘𝑘) · (𝐹‘(𝑘 + 1))))
125	124	oveq2d 7397	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = (𝑃 pCnt ((seq1( · , 𝐹)‘𝑘) · (𝐹‘(𝑘 + 1)))))
126	26	adantr 483	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 𝑃 ∈ ℙ)
127	56	simprd 498	. . . . . . . . . . . . . 14 ⊢ (𝜑 → seq1( · , 𝐹):ℕ⟶ℕ)
128	127	ffvelcdmda 7050	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (seq1( · , 𝐹)‘𝑘) ∈ ℕ)
129		nnz 12575	. . . . . . . . . . . . . 14 ⊢ ((seq1( · , 𝐹)‘𝑘) ∈ ℕ → (seq1( · , 𝐹)‘𝑘) ∈ ℤ)
130		nnne0 12233	. . . . . . . . . . . . . 14 ⊢ ((seq1( · , 𝐹)‘𝑘) ∈ ℕ → (seq1( · , 𝐹)‘𝑘) ≠ 0)
131	129, 130	jca 518	. . . . . . . . . . . . 13 ⊢ ((seq1( · , 𝐹)‘𝑘) ∈ ℕ → ((seq1( · , 𝐹)‘𝑘) ∈ ℤ ∧ (seq1( · , 𝐹)‘𝑘) ≠ 0))
132	128, 131	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((seq1( · , 𝐹)‘𝑘) ∈ ℤ ∧ (seq1( · , 𝐹)‘𝑘) ≠ 0))
133		nnz 12575	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘(𝑘 + 1)) ∈ ℕ → (𝐹‘(𝑘 + 1)) ∈ ℤ)
134		nnne0 12233	. . . . . . . . . . . . . 14 ⊢ ((𝐹‘(𝑘 + 1)) ∈ ℕ → (𝐹‘(𝑘 + 1)) ≠ 0)
135	133, 134	jca 518	. . . . . . . . . . . . 13 ⊢ ((𝐹‘(𝑘 + 1)) ∈ ℕ → ((𝐹‘(𝑘 + 1)) ∈ ℤ ∧ (𝐹‘(𝑘 + 1)) ≠ 0))
136	60, 135	syl 17	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝐹‘(𝑘 + 1)) ∈ ℤ ∧ (𝐹‘(𝑘 + 1)) ≠ 0))
137		pcmul 16859	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ ℙ ∧ ((seq1( · , 𝐹)‘𝑘) ∈ ℤ ∧ (seq1( · , 𝐹)‘𝑘) ≠ 0) ∧ ((𝐹‘(𝑘 + 1)) ∈ ℤ ∧ (𝐹‘(𝑘 + 1)) ≠ 0)) → (𝑃 pCnt ((seq1( · , 𝐹)‘𝑘) · (𝐹‘(𝑘 + 1)))) = ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))))
138	126, 132, 136, 137	syl3anc 1382	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑃 pCnt ((seq1( · , 𝐹)‘𝑘) · (𝐹‘(𝑘 + 1)))) = ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))))
139	125, 138	eqtrd 2787	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))))
140	139	adantrr 725	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))))
141		prmnn 16680	. . . . . . . . . . . . . . 15 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
142	26, 141	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑃 ∈ ℕ)
143	142	nnred 12211	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑃 ∈ ℝ)
144	143	adantr 483	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → 𝑃 ∈ ℝ)
145	144	leidd 11739	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → 𝑃 ≤ 𝑃)
146	145, 86	breqtrrd 5118	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → 𝑃 ≤ (𝑘 + 1))
147	146	iftrued 4478	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → if(𝑃 ≤ (𝑘 + 1), 𝐵, 0) = 𝐵)
148	140, 147	eqeq12d 2768	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0) ↔ ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = 𝐵))
149	107, 119, 148	3imtr4d 296	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) = 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0)))
150	149	expr 459	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝑘 + 1) = 𝑃 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0))))
151	139	adantrr 725	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))))
152		simplrr 785	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝑘 + 1) ≠ 𝑃)
153	152	necomd 3002	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → 𝑃 ≠ (𝑘 + 1))
154	26	ad2antrr 734	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → 𝑃 ∈ ℙ)
155		simpr 487	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝑘 + 1) ∈ ℙ)
156	55	ad2antrr 734	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → ∀𝑛 ∈ ℙ 𝐴 ∈ ℕ₀)
157	74	nfel1 2930	. . . . . . . . . . . . . . . . . . 19 ⊢ Ⅎ𝑛⦋(𝑘 + 1) / 𝑛⦌𝐴 ∈ ℕ₀
158	80	eleq1d 2837	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = (𝑘 + 1) → (𝐴 ∈ ℕ₀ ↔ ⦋(𝑘 + 1) / 𝑛⦌𝐴 ∈ ℕ₀))
159	157, 158	rspc 3560	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑘 + 1) ∈ ℙ → (∀𝑛 ∈ ℙ 𝐴 ∈ ℕ₀ → ⦋(𝑘 + 1) / 𝑛⦌𝐴 ∈ ℕ₀))
160	155, 156, 159	sylc 65	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → ⦋(𝑘 + 1) / 𝑛⦌𝐴 ∈ ℕ₀)
161		prmdvdsexpr 16724	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑃 ∈ ℙ ∧ (𝑘 + 1) ∈ ℙ ∧ ⦋(𝑘 + 1) / 𝑛⦌𝐴 ∈ ℕ₀) → (𝑃 ∥ ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴) → 𝑃 = (𝑘 + 1)))
162	154, 155, 160, 161	syl3anc 1382	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝑃 ∥ ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴) → 𝑃 = (𝑘 + 1)))
163	162	necon3ad 2960	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝑃 ≠ (𝑘 + 1) → ¬ 𝑃 ∥ ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴)))
164	153, 163	mpd 15	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → ¬ 𝑃 ∥ ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴))
165	58	ad2antrl 736	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑘 + 1) ∈ ℕ)
166	165, 68, 84	sylancl 594	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝐹‘(𝑘 + 1)) = if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1))
167		iftrue 4476	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 + 1) ∈ ℙ → if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1) = ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴))
168	166, 167	sylan9eq 2807	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝐹‘(𝑘 + 1)) = ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴))
169	168	breq2d 5102	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝑃 ∥ (𝐹‘(𝑘 + 1)) ↔ 𝑃 ∥ ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴)))
170	164, 169	mtbird 327	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → ¬ 𝑃 ∥ (𝐹‘(𝑘 + 1)))
171	57	adantr 483	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → 𝐹:ℕ⟶ℕ)
172	171, 165, 59	syl2anc 592	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝐹‘(𝑘 + 1)) ∈ ℕ)
173	172	adantr 483	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝐹‘(𝑘 + 1)) ∈ ℕ)
174		pceq0 16879	. . . . . . . . . . . . . 14 ⊢ ((𝑃 ∈ ℙ ∧ (𝐹‘(𝑘 + 1)) ∈ ℕ) → ((𝑃 pCnt (𝐹‘(𝑘 + 1))) = 0 ↔ ¬ 𝑃 ∥ (𝐹‘(𝑘 + 1))))
175	154, 173, 174	syl2anc 592	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → ((𝑃 pCnt (𝐹‘(𝑘 + 1))) = 0 ↔ ¬ 𝑃 ∥ (𝐹‘(𝑘 + 1))))
176	170, 175	mpbird 259	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ (𝑘 + 1) ∈ ℙ) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) = 0)
177		iffalse 4479	. . . . . . . . . . . . . . 15 ⊢ (¬ (𝑘 + 1) ∈ ℙ → if((𝑘 + 1) ∈ ℙ, ((𝑘 + 1)↑⦋(𝑘 + 1) / 𝑛⦌𝐴), 1) = 1)
178	166, 177	sylan9eq 2807	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ ¬ (𝑘 + 1) ∈ ℙ) → (𝐹‘(𝑘 + 1)) = 1)
179	178	oveq2d 7397	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ ¬ (𝑘 + 1) ∈ ℙ) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) = (𝑃 pCnt 1))
180	26, 41	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → (𝑃 pCnt 1) = 0)
181	180	ad2antrr 734	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ ¬ (𝑘 + 1) ∈ ℙ) → (𝑃 pCnt 1) = 0)
182	179, 181	eqtrd 2787	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) ∧ ¬ (𝑘 + 1) ∈ ℙ) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) = 0)
183	176, 182	pm2.61dan 820	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 pCnt (𝐹‘(𝑘 + 1))) = 0)
184	183	oveq2d 7397	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + (𝑃 pCnt (𝐹‘(𝑘 + 1)))) = ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + 0))
185	26	adantr 483	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → 𝑃 ∈ ℙ)
186	128	adantrr 725	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (seq1( · , 𝐹)‘𝑘) ∈ ℕ)
187	185, 186	pccld 16858	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) ∈ ℕ₀)
188	187	nn0cnd 12530	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) ∈ ℂ)
189	188	addridd 11369	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) + 0) = (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)))
190	151, 184, 189	3eqtrd 2791	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)))
191	142	adantr 483	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → 𝑃 ∈ ℕ)
192	191	nnred 12211	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → 𝑃 ∈ ℝ)
193	165	nnred 12211	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑘 + 1) ∈ ℝ)
194	192, 193	ltlend 11314	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 < (𝑘 + 1) ↔ (𝑃 ≤ (𝑘 + 1) ∧ (𝑘 + 1) ≠ 𝑃)))
195		simprl 778	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → 𝑘 ∈ ℕ)
196		nnleltp1 12614	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ) → (𝑃 ≤ 𝑘 ↔ 𝑃 < (𝑘 + 1)))
197	191, 195, 196	syl2anc 592	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 ≤ 𝑘 ↔ 𝑃 < (𝑘 + 1)))
198		simprr 780	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑘 + 1) ≠ 𝑃)
199	198	biantrud 538	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 ≤ (𝑘 + 1) ↔ (𝑃 ≤ (𝑘 + 1) ∧ (𝑘 + 1) ≠ 𝑃)))
200	194, 197, 199	3bitr4rd 314	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → (𝑃 ≤ (𝑘 + 1) ↔ 𝑃 ≤ 𝑘))
201	200	ifbid 4494	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → if(𝑃 ≤ (𝑘 + 1), 𝐵, 0) = if(𝑃 ≤ 𝑘, 𝐵, 0))
202	190, 201	eqeq12d 2768	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0) ↔ (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0)))
203	202	biimprd 250	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑘 ∈ ℕ ∧ (𝑘 + 1) ≠ 𝑃)) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0)))
204	203	expr 459	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝑘 + 1) ≠ 𝑃 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0))))
205	150, 204	pm2.61dne 3033	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0)))
206	205	expcom 416	. . . 4 ⊢ (𝑘 ∈ ℕ → (𝜑 → ((𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0) → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0))))
207	206	a2d 29	. . 3 ⊢ (𝑘 ∈ ℕ → ((𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑘)) = if(𝑃 ≤ 𝑘, 𝐵, 0)) → (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘(𝑘 + 1))) = if(𝑃 ≤ (𝑘 + 1), 𝐵, 0))))
208	7, 13, 19, 25, 53, 207	nnind 12214	. 2 ⊢ (𝑁 ∈ ℕ → (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑁)) = if(𝑃 ≤ 𝑁, 𝐵, 0)))
209	1, 208	mpcom 38	1 ⊢ (𝜑 → (𝑃 pCnt (seq1( · , 𝐹)‘𝑁)) = if(𝑃 ≤ 𝑁, 𝐵, 0))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1550 ∈ wcel 2132 ≠ wne 2947 ∀wral 3066 Vcvv 3444 ⦋csb 3843 ifcif 4470 class class class wbr 5090 ↦ cmpt 5171 ⟶wf 6502 ‘cfv 6506 (class class class)co 7381 ℝcr 11058 0cc0 11059 1c1 11060 + caddc 11062 · cmul 11064 < clt 11202 ≤ cle 11203 ℕcn 12196 2c2 12258 ℕ₀cn0 12467 ℤcz 12554 ℤ_≥cuz 12825 seqcseq 14000 ↑cexp 14060 ∥ cdvds 16258 ℙcprime 16677 pCnt cpc 16844

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-10 2165 ax-11 2181 ax-12 2202 ax-ext 2724 ax-sep 5236 ax-nul 5246 ax-pow 5312 ax-pr 5380 ax-un 7703 ax-cnex 11115 ax-resscn 11116 ax-1cn 11117 ax-icn 11118 ax-addcl 11119 ax-addrcl 11120 ax-mulcl 11121 ax-mulrcl 11122 ax-mulcom 11123 ax-addass 11124 ax-mulass 11125 ax-distr 11126 ax-i2m1 11127 ax-1ne0 11128 ax-1rid 11129 ax-rnegex 11130 ax-rrecex 11131 ax-cnre 11132 ax-pre-lttri 11133 ax-pre-lttrn 11134 ax-pre-ltadd 11135 ax-pre-mulgt0 11136 ax-pre-sup 11137

This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3or 1096 df-3an 1097 df-tru 1553 df-fal 1563 df-ex 1790 df-nf 1794 df-sb 2081 df-mo 2556 df-eu 2586 df-clab 2731 df-cleq 2744 df-clel 2827 df-nfc 2901 df-ne 2948 df-nel 3052 df-ral 3067 df-rex 3077 df-rmo 3357 df-reu 3358 df-rab 3405 df-v 3446 df-sbc 3736 df-csb 3844 df-dif 3898 df-un 3900 df-in 3902 df-ss 3912 df-pss 3915 df-nul 4277 df-if 4471 df-pw 4547 df-sn 4573 df-pr 4575 df-op 4579 df-uni 4856 df-iun 4941 df-br 5091 df-opab 5153 df-mpt 5172 df-tr 5198 df-id 5531 df-eprel 5536 df-po 5544 df-so 5545 df-fr 5589 df-we 5591 df-xp 5642 df-rel 5643 df-cnv 5644 df-co 5645 df-dm 5646 df-rn 5647 df-res 5648 df-ima 5649 df-pred 6273 df-ord 6334 df-on 6335 df-lim 6336 df-suc 6337 df-iota 6462 df-fun 6508 df-fn 6509 df-f 6510 df-f1 6511 df-fo 6512 df-f1o 6513 df-fv 6514 df-riota 7338 df-ov 7384 df-oprab 7385 df-mpo 7386 df-om 7832 df-1st 7955 df-2nd 7956 df-frecs 8246 df-wrecs 8277 df-recs 8326 df-rdg 8365 df-1o 8421 df-2o 8422 df-er 8662 df-en 8913 df-dom 8914 df-sdom 8915 df-fin 8916 df-sup 9374 df-inf 9375 df-pnf 11204 df-mnf 11205 df-xr 11206 df-ltxr 11207 df-le 11208 df-sub 11402 df-neg 11403 df-div 11831 df-nn 12197 df-2 12266 df-3 12267 df-n0 12468 df-z 12555 df-uz 12826 df-q 12936 df-rp 12980 df-fz 13499 df-fl 13788 df-mod 13866 df-seq 14001 df-exp 14061 df-cj 15098 df-re 15099 df-im 15100 df-sqrt 15234 df-abs 15235 df-dvds 16259 df-gcd 16501 df-prm 16678 df-pc 16845

This theorem is referenced by: pcmpt2 16901 pcprod 16903 1arithlem4 16934 chtublem 27241 bposlem3 27316

W3C validator