Theorem pcfac 16991

Description: Calculate the prime count of a factorial. (Contributed by Mario Carneiro, 11-Mar-2014.) (Revised by Mario Carneiro, 21-May-2014.)

Assertion

Ref	Expression
pcfac	⊢ ((𝑁 ∈ ℕ0 ∧ 𝑀 ∈ (ℤ≥‘𝑁) ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘))))

Distinct variable groups:   𝑃,𝑘   𝑘,𝑁   𝑘,𝑀

Proof of Theorem pcfac

Dummy variables 𝑚 𝑛 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6878	. . . . . . . 8 ⊢ (𝑥 = 0 → (ℤ≥‘𝑥) = (ℤ≥‘0))
2		fveq2 6878	. . . . . . . . . 10 ⊢ (𝑥 = 0 → (!‘𝑥) = (!‘0))
3	2	oveq2d 7429	. . . . . . . . 9 ⊢ (𝑥 = 0 → (𝑃 pCnt (!‘𝑥)) = (𝑃 pCnt (!‘0)))
4		fvoveq1 7436	. . . . . . . . . 10 ⊢ (𝑥 = 0 → (⌊‘(𝑥 / (𝑃↑𝑘))) = (⌊‘(0 / (𝑃↑𝑘))))
5	4	sumeq2sdv 15790	. . . . . . . . 9 ⊢ (𝑥 = 0 → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))))
6	3, 5	eqeq12d 2776	. . . . . . . 8 ⊢ (𝑥 = 0 → ((𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘)))))
7	1, 6	raleqbidv 3334	. . . . . . 7 ⊢ (𝑥 = 0 → (∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ ∀𝑚 ∈ (ℤ≥‘0)(𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘)))))
8	7	imbi2d 343	. . . . . 6 ⊢ (𝑥 = 0 → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘)))) ↔ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘0)(𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))))))
9		fveq2 6878	. . . . . . . 8 ⊢ (𝑥 = 𝑛 → (ℤ≥‘𝑥) = (ℤ≥‘𝑛))
10		fveq2 6878	. . . . . . . . . 10 ⊢ (𝑥 = 𝑛 → (!‘𝑥) = (!‘𝑛))
11	10	oveq2d 7429	. . . . . . . . 9 ⊢ (𝑥 = 𝑛 → (𝑃 pCnt (!‘𝑥)) = (𝑃 pCnt (!‘𝑛)))
12		fvoveq1 7436	. . . . . . . . . 10 ⊢ (𝑥 = 𝑛 → (⌊‘(𝑥 / (𝑃↑𝑘))) = (⌊‘(𝑛 / (𝑃↑𝑘))))
13	12	sumeq2sdv 15790	. . . . . . . . 9 ⊢ (𝑥 = 𝑛 → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))))
14	11, 13	eqeq12d 2776	. . . . . . . 8 ⊢ (𝑥 = 𝑛 → ((𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
15	9, 14	raleqbidv 3334	. . . . . . 7 ⊢ (𝑥 = 𝑛 → (∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ ∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
16	15	imbi2d 343	. . . . . 6 ⊢ (𝑥 = 𝑛 → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘)))) ↔ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))))))
17		fveq2 6878	. . . . . . . 8 ⊢ (𝑥 = (𝑛 + 1) → (ℤ≥‘𝑥) = (ℤ≥‘(𝑛 + 1)))
18		fveq2 6878	. . . . . . . . . 10 ⊢ (𝑥 = (𝑛 + 1) → (!‘𝑥) = (!‘(𝑛 + 1)))
19	18	oveq2d 7429	. . . . . . . . 9 ⊢ (𝑥 = (𝑛 + 1) → (𝑃 pCnt (!‘𝑥)) = (𝑃 pCnt (!‘(𝑛 + 1))))
20		fvoveq1 7436	. . . . . . . . . 10 ⊢ (𝑥 = (𝑛 + 1) → (⌊‘(𝑥 / (𝑃↑𝑘))) = (⌊‘((𝑛 + 1) / (𝑃↑𝑘))))
21	20	sumeq2sdv 15790	. . . . . . . . 9 ⊢ (𝑥 = (𝑛 + 1) → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))
22	19, 21	eqeq12d 2776	. . . . . . . 8 ⊢ (𝑥 = (𝑛 + 1) → ((𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
23	17, 22	raleqbidv 3334	. . . . . . 7 ⊢ (𝑥 = (𝑛 + 1) → (∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
24	23	imbi2d 343	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘)))) ↔ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))))
25		fveq2 6878	. . . . . . . 8 ⊢ (𝑥 = 𝑁 → (ℤ≥‘𝑥) = (ℤ≥‘𝑁))
26		fveq2 6878	. . . . . . . . . 10 ⊢ (𝑥 = 𝑁 → (!‘𝑥) = (!‘𝑁))
27	26	oveq2d 7429	. . . . . . . . 9 ⊢ (𝑥 = 𝑁 → (𝑃 pCnt (!‘𝑥)) = (𝑃 pCnt (!‘𝑁)))
28		fvoveq1 7436	. . . . . . . . . 10 ⊢ (𝑥 = 𝑁 → (⌊‘(𝑥 / (𝑃↑𝑘))) = (⌊‘(𝑁 / (𝑃↑𝑘))))
29	28	sumeq2sdv 15790	. . . . . . . . 9 ⊢ (𝑥 = 𝑁 → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))))
30	27, 29	eqeq12d 2776	. . . . . . . 8 ⊢ (𝑥 = 𝑁 → ((𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘)))))
31	25, 30	raleqbidv 3334	. . . . . . 7 ⊢ (𝑥 = 𝑁 → (∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ ∀𝑚 ∈ (ℤ≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘)))))
32	31	imbi2d 343	. . . . . 6 ⊢ (𝑥 = 𝑁 → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘)))) ↔ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))))))
33		fzfid 14037	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) → (1...𝑚) ∈ Fin)
34		sumz 15808	. . . . . . . . . 10 ⊢ (((1...𝑚) ⊆ (ℤ≥‘1) ∨ (1...𝑚) ∈ Fin) → Σ𝑘 ∈ (1...𝑚)0 = 0)
35	34	olcs 890	. . . . . . . . 9 ⊢ ((1...𝑚) ∈ Fin → Σ𝑘 ∈ (1...𝑚)0 = 0)
36	33, 35	syl 18	. . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) → Σ𝑘 ∈ (1...𝑚)0 = 0)
37		0nn0 12543	. . . . . . . . . 10 ⊢ 0 ∈ ℕ0
38		elfznn 13608	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (1...𝑚) → 𝑘 ∈ ℕ)
39	38	nnnn0d 12589	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (1...𝑚) → 𝑘 ∈ ℕ0)
40		nn0uz 12925	. . . . . . . . . . . 12 ⊢ ℕ0 = (ℤ≥‘0)
41	39, 40	eleqtrdi 2870	. . . . . . . . . . 11 ⊢ (𝑘 ∈ (1...𝑚) → 𝑘 ∈ (ℤ≥‘0))
42	41	adantl 487	. . . . . . . . . 10 ⊢ (((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) ∧ 𝑘 ∈ (1...𝑚)) → 𝑘 ∈ (ℤ≥‘0))
43		simpll 779	. . . . . . . . . 10 ⊢ (((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) ∧ 𝑘 ∈ (1...𝑚)) → 𝑃 ∈ ℙ)
44		pcfaclem 16990	. . . . . . . . . 10 ⊢ ((0 ∈ ℕ0 ∧ 𝑘 ∈ (ℤ≥‘0) ∧ 𝑃 ∈ ℙ) → (⌊‘(0 / (𝑃↑𝑘))) = 0)
45	37, 42, 43, 44	mp3an2i 1495	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘(0 / (𝑃↑𝑘))) = 0)
46	45	sumeq2dv 15789	. . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) → Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)0)
47		fac0 14340	. . . . . . . . . . 11 ⊢ (!‘0) = 1
48	47	oveq2i 7424	. . . . . . . . . 10 ⊢ (𝑃 pCnt (!‘0)) = (𝑃 pCnt 1)
49		pc1 16947	. . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt 1) = 0)
50	48, 49	eqtrid 2807	. . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt (!‘0)) = 0)
51	50	adantr 486	. . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) → (𝑃 pCnt (!‘0)) = 0)
52	36, 46, 51	3eqtr4rd 2806	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) → (𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))))
53	52	ralrimiva 3154	. . . . . 6 ⊢ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘0)(𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))))
54		nn0z 12639	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ0 → 𝑛 ∈ ℤ)
55	54	adantr 486	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → 𝑛 ∈ ℤ)
56		uzid 12902	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ (ℤ≥‘𝑛))
57		peano2uz 12950	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ≥‘𝑛) → (𝑛 + 1) ∈ (ℤ≥‘𝑛))
58	55, 56, 57	3syl 19	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → (𝑛 + 1) ∈ (ℤ≥‘𝑛))
59		uzss 12910	. . . . . . . . . 10 ⊢ ((𝑛 + 1) ∈ (ℤ≥‘𝑛) → (ℤ≥‘(𝑛 + 1)) ⊆ (ℤ≥‘𝑛))
60		ssralv 4000	. . . . . . . . . 10 ⊢ ((ℤ≥‘(𝑛 + 1)) ⊆ (ℤ≥‘𝑛) → (∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
61	58, 59, 60	3syl 19	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → (∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
62		oveq1 7420	. . . . . . . . . . 11 ⊢ ((𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))) = (Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) + (𝑃 pCnt (𝑛 + 1))))
63		simpll 779	. . . . . . . . . . . . . . 15 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑛 ∈ ℕ0)
64		facp1 14342	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ0 → (!‘(𝑛 + 1)) = ((!‘𝑛) · (𝑛 + 1)))
65	63, 64	syl 18	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (!‘(𝑛 + 1)) = ((!‘𝑛) · (𝑛 + 1)))
66	65	oveq2d 7429	. . . . . . . . . . . . 13 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (!‘(𝑛 + 1))) = (𝑃 pCnt ((!‘𝑛) · (𝑛 + 1))))
67		simplr 781	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑃 ∈ ℙ)
68		faccl 14347	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ0 → (!‘𝑛) ∈ ℕ)
69		nnz 12636	. . . . . . . . . . . . . . . 16 ⊢ ((!‘𝑛) ∈ ℕ → (!‘𝑛) ∈ ℤ)
70		nnne0 12294	. . . . . . . . . . . . . . . 16 ⊢ ((!‘𝑛) ∈ ℕ → (!‘𝑛) ≠ 0)
71	69, 70	jca 521	. . . . . . . . . . . . . . 15 ⊢ ((!‘𝑛) ∈ ℕ → ((!‘𝑛) ∈ ℤ ∧ (!‘𝑛) ≠ 0))
72	63, 68, 71	3syl 19	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((!‘𝑛) ∈ ℤ ∧ (!‘𝑛) ≠ 0))
73		nn0p1nn 12567	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ0 → (𝑛 + 1) ∈ ℕ)
74		nnz 12636	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 + 1) ∈ ℕ → (𝑛 + 1) ∈ ℤ)
75		nnne0 12294	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 + 1) ∈ ℕ → (𝑛 + 1) ≠ 0)
76	74, 75	jca 521	. . . . . . . . . . . . . . 15 ⊢ ((𝑛 + 1) ∈ ℕ → ((𝑛 + 1) ∈ ℤ ∧ (𝑛 + 1) ≠ 0))
77	63, 73, 76	3syl 19	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑛 + 1) ∈ ℤ ∧ (𝑛 + 1) ≠ 0))
78		pcmul 16943	. . . . . . . . . . . . . 14 ⊢ ((𝑃 ∈ ℙ ∧ ((!‘𝑛) ∈ ℤ ∧ (!‘𝑛) ≠ 0) ∧ ((𝑛 + 1) ∈ ℤ ∧ (𝑛 + 1) ≠ 0)) → (𝑃 pCnt ((!‘𝑛) · (𝑛 + 1))) = ((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))))
79	67, 72, 77, 78	syl3anc 1398	. . . . . . . . . . . . 13 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt ((!‘𝑛) · (𝑛 + 1))) = ((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))))
80	66, 79	eqtr2d 2796	. . . . . . . . . . . 12 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))) = (𝑃 pCnt (!‘(𝑛 + 1))))
81	63	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑛 ∈ ℕ0)
82	81	nn0zd 12640	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑛 ∈ ℤ)
83		prmnn 16764	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
84	83	ad2antlr 740	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑃 ∈ ℕ)
85		nnexpcl 14138	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → (𝑃↑𝑘) ∈ ℕ)
86	84, 39, 85	syl2an 608	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑃↑𝑘) ∈ ℕ)
87		fldivp1 16989	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 ∈ ℤ ∧ (𝑃↑𝑘) ∈ ℕ) → ((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = if((𝑃↑𝑘) ∥ (𝑛 + 1), 1, 0))
88	82, 86, 87	syl2anc 596	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → ((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = if((𝑃↑𝑘) ∥ (𝑛 + 1), 1, 0))
89		elfzuz 13574	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (1...𝑚) → 𝑘 ∈ (ℤ≥‘1))
90	63, 73	syl 18	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑛 + 1) ∈ ℕ)
91	67, 90	pccld 16942	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ∈ ℕ0)
92	91	nn0zd 12640	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ∈ ℤ)
93		elfz5 13570	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑘 ∈ (ℤ≥‘1) ∧ (𝑃 pCnt (𝑛 + 1)) ∈ ℤ) → (𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))) ↔ 𝑘 ≤ (𝑃 pCnt (𝑛 + 1))))
94	89, 92, 93	syl2anr 609	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))) ↔ 𝑘 ≤ (𝑃 pCnt (𝑛 + 1))))
95		simpllr 788	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑃 ∈ ℙ)
96	81, 73	syl 18	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑛 + 1) ∈ ℕ)
97	96	nnzd 12641	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑛 + 1) ∈ ℤ)
98	39	adantl 487	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑘 ∈ ℕ0)
99		pcdvdsb 16961	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑃 ∈ ℙ ∧ (𝑛 + 1) ∈ ℤ ∧ 𝑘 ∈ ℕ0) → (𝑘 ≤ (𝑃 pCnt (𝑛 + 1)) ↔ (𝑃↑𝑘) ∥ (𝑛 + 1)))
100	95, 97, 98, 99	syl3anc 1398	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑘 ≤ (𝑃 pCnt (𝑛 + 1)) ↔ (𝑃↑𝑘) ∥ (𝑛 + 1)))
101	94, 100	bitr2d 283	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → ((𝑃↑𝑘) ∥ (𝑛 + 1) ↔ 𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1)))))
102	101	ifbid 4506	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → if((𝑃↑𝑘) ∥ (𝑛 + 1), 1, 0) = if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0))
103	88, 102	eqtrd 2795	. . . . . . . . . . . . . . 15 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → ((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0))
104	103	sumeq2dv 15789	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = Σ𝑘 ∈ (1...𝑚)if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0))
105		fzfid 14037	. . . . . . . . . . . . . . 15 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (1...𝑚) ∈ Fin)
106	63	nn0red 12590	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑛 ∈ ℝ)
107		peano2re 11407	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ ℝ → (𝑛 + 1) ∈ ℝ)
108	106, 107	syl 18	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑛 + 1) ∈ ℝ)
109	108	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑛 + 1) ∈ ℝ)
110	109, 86	nndivred 12314	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → ((𝑛 + 1) / (𝑃↑𝑘)) ∈ ℝ)
111	110	flcld 13859	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘((𝑛 + 1) / (𝑃↑𝑘))) ∈ ℤ)
112	111	zcnd 12726	. . . . . . . . . . . . . . 15 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘((𝑛 + 1) / (𝑃↑𝑘))) ∈ ℂ)
113	106	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑛 ∈ ℝ)
114	113, 86	nndivred 12314	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑛 / (𝑃↑𝑘)) ∈ ℝ)
115	114	flcld 13859	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘(𝑛 / (𝑃↑𝑘))) ∈ ℤ)
116	115	zcnd 12726	. . . . . . . . . . . . . . 15 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘(𝑛 / (𝑃↑𝑘))) ∈ ℂ)
117	105, 112, 116	fsumsub 15874	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = (Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
118		fzfi 14036	. . . . . . . . . . . . . . . 16 ⊢ (1...𝑚) ∈ Fin
119	91	nn0red 12590	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ∈ ℝ)
120		eluzelz 12897	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑚 ∈ (ℤ≥‘(𝑛 + 1)) → 𝑚 ∈ ℤ)
121	120	adantl 487	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑚 ∈ ℤ)
122	121	zred 12725	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑚 ∈ ℝ)
123		prmuz2 16786	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ≥‘2))
124	123	ad2antlr 740	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑃 ∈ (ℤ≥‘2))
125	90	nnnn0d 12589	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑛 + 1) ∈ ℕ0)
126		bernneq3 14295	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑛 + 1) ∈ ℕ0) → (𝑛 + 1) < (𝑃↑(𝑛 + 1)))
127	124, 125, 126	syl2anc 596	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑛 + 1) < (𝑃↑(𝑛 + 1)))
128	119, 108	letrid 11386	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1) ∨ (𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1))))
129	128	ord 878	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (¬ (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1) → (𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1))))
130	90	nnzd 12641	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑛 + 1) ∈ ℤ)
131		pcdvdsb 16961	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑃 ∈ ℙ ∧ (𝑛 + 1) ∈ ℤ ∧ (𝑛 + 1) ∈ ℕ0) → ((𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1)) ↔ (𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1)))
132	67, 130, 125, 131	syl3anc 1398	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1)) ↔ (𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1)))
133	84, 125	nnexpcld 14309	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃↑(𝑛 + 1)) ∈ ℕ)
134	133	nnzd 12641	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃↑(𝑛 + 1)) ∈ ℤ)
135		dvdsle 16400	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑃↑(𝑛 + 1)) ∈ ℤ ∧ (𝑛 + 1) ∈ ℕ) → ((𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1) → (𝑃↑(𝑛 + 1)) ≤ (𝑛 + 1)))
136	134, 90, 135	syl2anc 596	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1) → (𝑃↑(𝑛 + 1)) ≤ (𝑛 + 1)))
137	133	nnred 12272	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃↑(𝑛 + 1)) ∈ ℝ)
138	137, 108	lenltd 11380	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑃↑(𝑛 + 1)) ≤ (𝑛 + 1) ↔ ¬ (𝑛 + 1) < (𝑃↑(𝑛 + 1))))
139	136, 138	sylibd 242	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1) → ¬ (𝑛 + 1) < (𝑃↑(𝑛 + 1))))
140	132, 139	sylbid 243	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1)) → ¬ (𝑛 + 1) < (𝑃↑(𝑛 + 1))))
141	129, 140	syld 48	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (¬ (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1) → ¬ (𝑛 + 1) < (𝑃↑(𝑛 + 1))))
142	127, 141	mt4d 118	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1))
143		eluzle 12900	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑚 ∈ (ℤ≥‘(𝑛 + 1)) → (𝑛 + 1) ≤ 𝑚)
144	143	adantl 487	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑛 + 1) ≤ 𝑚)
145	119, 108, 122, 142, 144	letrd 11391	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ≤ 𝑚)
146		eluz 12901	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑃 pCnt (𝑛 + 1)) ∈ ℤ ∧ 𝑚 ∈ ℤ) → (𝑚 ∈ (ℤ≥‘(𝑃 pCnt (𝑛 + 1))) ↔ (𝑃 pCnt (𝑛 + 1)) ≤ 𝑚))
147	92, 121, 146	syl2anc 596	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑚 ∈ (ℤ≥‘(𝑃 pCnt (𝑛 + 1))) ↔ (𝑃 pCnt (𝑛 + 1)) ≤ 𝑚))
148	145, 147	mpbird 260	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑚 ∈ (ℤ≥‘(𝑃 pCnt (𝑛 + 1))))
149		fzss2 13619	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 ∈ (ℤ≥‘(𝑃 pCnt (𝑛 + 1))) → (1...(𝑃 pCnt (𝑛 + 1))) ⊆ (1...𝑚))
150	148, 149	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (1...(𝑃 pCnt (𝑛 + 1))) ⊆ (1...𝑚))
151		sumhash 16988	. . . . . . . . . . . . . . . 16 ⊢ (((1...𝑚) ∈ Fin ∧ (1...(𝑃 pCnt (𝑛 + 1))) ⊆ (1...𝑚)) → Σ𝑘 ∈ (1...𝑚)if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0) = (♯‘(1...(𝑃 pCnt (𝑛 + 1)))))
152	118, 150, 151	sylancr 599	. . . . . . . . . . . . . . 15 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0) = (♯‘(1...(𝑃 pCnt (𝑛 + 1)))))
153		hashfz1 14410	. . . . . . . . . . . . . . . 16 ⊢ ((𝑃 pCnt (𝑛 + 1)) ∈ ℕ0 → (♯‘(1...(𝑃 pCnt (𝑛 + 1)))) = (𝑃 pCnt (𝑛 + 1)))
154	91, 153	syl 18	. . . . . . . . . . . . . . 15 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (♯‘(1...(𝑃 pCnt (𝑛 + 1)))) = (𝑃 pCnt (𝑛 + 1)))
155	152, 154	eqtrd 2795	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0) = (𝑃 pCnt (𝑛 + 1)))
156	104, 117, 155	3eqtr3d 2803	. . . . . . . . . . . . 13 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))) = (𝑃 pCnt (𝑛 + 1)))
157	105, 112	fsumcl 15819	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))) ∈ ℂ)
158	105, 116	fsumcl 15819	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) ∈ ℂ)
159	119	recnd 11261	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ∈ ℂ)
160	157, 158, 159	subaddd 11611	. . . . . . . . . . . . 13 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))) = (𝑃 pCnt (𝑛 + 1)) ↔ (Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) + (𝑃 pCnt (𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
161	156, 160	mpbid 235	. . . . . . . . . . . 12 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) + (𝑃 pCnt (𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))
162	80, 161	eqeq12d 2776	. . . . . . . . . . 11 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))) = (Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) + (𝑃 pCnt (𝑛 + 1))) ↔ (𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
163	62, 162	imbitrid 247	. . . . . . . . . 10 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → (𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
164	163	ralimdva 3174	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → (∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
165	61, 164	syld 48	. . . . . . . 8 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → (∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
166	165	ex 418	. . . . . . 7 ⊢ (𝑛 ∈ ℕ0 → (𝑃 ∈ ℙ → (∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))))
167	166	a2d 30	. . . . . 6 ⊢ (𝑛 ∈ ℕ0 → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))) → (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))))
168	8, 16, 24, 32, 53, 167	nn0ind 12716	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘)))))
169	168	imp 412	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → ∀𝑚 ∈ (ℤ≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))))
170		oveq2 7421	. . . . . . 7 ⊢ (𝑚 = 𝑀 → (1...𝑚) = (1...𝑀))
171	170	sumeq1d 15787	. . . . . 6 ⊢ (𝑚 = 𝑀 → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘))))
172	171	eqeq2d 2771	. . . . 5 ⊢ (𝑚 = 𝑀 → ((𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘)))))
173	172	rspcv 3572	. . . 4 ⊢ (𝑀 ∈ (ℤ≥‘𝑁) → (∀𝑚 ∈ (ℤ≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))) → (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘)))))
174	169, 173	syl5 35	. . 3 ⊢ (𝑀 ∈ (ℤ≥‘𝑁) → ((𝑁 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘)))))
175	174	3impib 1134	. 2 ⊢ ((𝑀 ∈ (ℤ≥‘𝑁) ∧ 𝑁 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘))))
176	175	3com12 1141	1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑀 ∈ (ℤ≥‘𝑁) ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘))))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2955  ∀wral 3076   ⊆ wss 3899  ifcif 4482   class class class wbr 5103  ‘cfv 6533  (class class class)co 7413  Fincfn 8952  ℝcr 11123  0cc0 11124  1c1 11125   + caddc 11127   · cmul 11129   < clt 11267   ≤ cle 11268   − cmin 11465   / cdiv 11895  ℕcn 12257  2c2 12319  ℕ₀cn0 12528  ℤcz 12615  ℤ_≥cuz 12887  ...cfz 13561  ⌊cfl 13851  ↑cexp 14125  !cfa 14337  ♯chash 14394  Σcsu 15773   ∥ cdvds 16342  ℙcprime 16761   pCnt cpc 16928

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-rep 5232  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736  ax-inf2 9620  ax-cnex 11180  ax-resscn 11181  ax-1cn 11182  ax-icn 11183  ax-addcl 11184  ax-addrcl 11185  ax-mulcl 11186  ax-mulrcl 11187  ax-mulcom 11188  ax-addass 11189  ax-mulass 11190  ax-distr 11191  ax-i2m1 11192  ax-1ne0 11193  ax-1rid 11194  ax-rnegex 11195  ax-rrecex 11196  ax-cnre 11197  ax-pre-lttri 11198  ax-pre-lttrn 11199  ax-pre-ltadd 11200  ax-pre-mulgt0 11201  ax-pre-sup 11202

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6299  df-ord 6360  df-on 6361  df-lim 6362  df-suc 6363  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-isom 6542  df-riota 7370  df-ov 7416  df-oprab 7417  df-mpo 7418  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-1o 8455  df-2o 8456  df-er 8696  df-en 8953  df-dom 8954  df-sdom 8955  df-fin 8956  df-sup 9412  df-inf 9413  df-oi 9482  df-card 9944  df-pnf 11269  df-mnf 11270  df-xr 11271  df-ltxr 11272  df-le 11273  df-sub 11467  df-neg 11468  df-div 11896  df-nn 12258  df-2 12327  df-3 12328  df-n0 12529  df-z 12616  df-uz 12888  df-q 12998  df-rp 13043  df-fz 13562  df-fzo 13710  df-fl 13853  df-mod 13931  df-seq 14066  df-exp 14126  df-fac 14338  df-hash 14395  df-cj 15186  df-re 15187  df-im 15188  df-sqrt 15322  df-abs 15323  df-clim 15575  df-sum 15774  df-dvds 16343  df-gcd 16585  df-prm 16762  df-pc 16929

This theorem is used by:  pcbc  16992