Theorem pcfac 16846

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 6840	. . . . . . . 8 ⊢ (𝑥 = 0 → (ℤ≥‘𝑥) = (ℤ≥‘0))
2		fveq2 6840	. . . . . . . . . 10 ⊢ (𝑥 = 0 → (!‘𝑥) = (!‘0))
3	2	oveq2d 7385	. . . . . . . . 9 ⊢ (𝑥 = 0 → (𝑃 pCnt (!‘𝑥)) = (𝑃 pCnt (!‘0)))
4		fvoveq1 7392	. . . . . . . . . 10 ⊢ (𝑥 = 0 → (⌊‘(𝑥 / (𝑃↑𝑘))) = (⌊‘(0 / (𝑃↑𝑘))))
5	4	sumeq2sdv 15645	. . . . . . . . 9 ⊢ (𝑥 = 0 → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))))
6	3, 5	eqeq12d 2745	. . . . . . . 8 ⊢ (𝑥 = 0 → ((𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘)))))
7	1, 6	raleqbidv 3316	. . . . . . 7 ⊢ (𝑥 = 0 → (∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ ∀𝑚 ∈ (ℤ≥‘0)(𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘)))))
8	7	imbi2d 340	. . . . . 6 ⊢ (𝑥 = 0 → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘)))) ↔ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘0)(𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))))))
9		fveq2 6840	. . . . . . . 8 ⊢ (𝑥 = 𝑛 → (ℤ≥‘𝑥) = (ℤ≥‘𝑛))
10		fveq2 6840	. . . . . . . . . 10 ⊢ (𝑥 = 𝑛 → (!‘𝑥) = (!‘𝑛))
11	10	oveq2d 7385	. . . . . . . . 9 ⊢ (𝑥 = 𝑛 → (𝑃 pCnt (!‘𝑥)) = (𝑃 pCnt (!‘𝑛)))
12		fvoveq1 7392	. . . . . . . . . 10 ⊢ (𝑥 = 𝑛 → (⌊‘(𝑥 / (𝑃↑𝑘))) = (⌊‘(𝑛 / (𝑃↑𝑘))))
13	12	sumeq2sdv 15645	. . . . . . . . 9 ⊢ (𝑥 = 𝑛 → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))))
14	11, 13	eqeq12d 2745	. . . . . . . 8 ⊢ (𝑥 = 𝑛 → ((𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
15	9, 14	raleqbidv 3316	. . . . . . 7 ⊢ (𝑥 = 𝑛 → (∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ ∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
16	15	imbi2d 340	. . . . . 6 ⊢ (𝑥 = 𝑛 → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘)))) ↔ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))))))
17		fveq2 6840	. . . . . . . 8 ⊢ (𝑥 = (𝑛 + 1) → (ℤ≥‘𝑥) = (ℤ≥‘(𝑛 + 1)))
18		fveq2 6840	. . . . . . . . . 10 ⊢ (𝑥 = (𝑛 + 1) → (!‘𝑥) = (!‘(𝑛 + 1)))
19	18	oveq2d 7385	. . . . . . . . 9 ⊢ (𝑥 = (𝑛 + 1) → (𝑃 pCnt (!‘𝑥)) = (𝑃 pCnt (!‘(𝑛 + 1))))
20		fvoveq1 7392	. . . . . . . . . 10 ⊢ (𝑥 = (𝑛 + 1) → (⌊‘(𝑥 / (𝑃↑𝑘))) = (⌊‘((𝑛 + 1) / (𝑃↑𝑘))))
21	20	sumeq2sdv 15645	. . . . . . . . 9 ⊢ (𝑥 = (𝑛 + 1) → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))
22	19, 21	eqeq12d 2745	. . . . . . . 8 ⊢ (𝑥 = (𝑛 + 1) → ((𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
23	17, 22	raleqbidv 3316	. . . . . . 7 ⊢ (𝑥 = (𝑛 + 1) → (∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
24	23	imbi2d 340	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘)))) ↔ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))))
25		fveq2 6840	. . . . . . . 8 ⊢ (𝑥 = 𝑁 → (ℤ≥‘𝑥) = (ℤ≥‘𝑁))
26		fveq2 6840	. . . . . . . . . 10 ⊢ (𝑥 = 𝑁 → (!‘𝑥) = (!‘𝑁))
27	26	oveq2d 7385	. . . . . . . . 9 ⊢ (𝑥 = 𝑁 → (𝑃 pCnt (!‘𝑥)) = (𝑃 pCnt (!‘𝑁)))
28		fvoveq1 7392	. . . . . . . . . 10 ⊢ (𝑥 = 𝑁 → (⌊‘(𝑥 / (𝑃↑𝑘))) = (⌊‘(𝑁 / (𝑃↑𝑘))))
29	28	sumeq2sdv 15645	. . . . . . . . 9 ⊢ (𝑥 = 𝑁 → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))))
30	27, 29	eqeq12d 2745	. . . . . . . 8 ⊢ (𝑥 = 𝑁 → ((𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘)))))
31	25, 30	raleqbidv 3316	. . . . . . 7 ⊢ (𝑥 = 𝑁 → (∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ ∀𝑚 ∈ (ℤ≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘)))))
32	31	imbi2d 340	. . . . . 6 ⊢ (𝑥 = 𝑁 → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘)))) ↔ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))))))
33		fzfid 13914	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) → (1...𝑚) ∈ Fin)
34		sumz 15664	. . . . . . . . . 10 ⊢ (((1...𝑚) ⊆ (ℤ≥‘1) ∨ (1...𝑚) ∈ Fin) → Σ𝑘 ∈ (1...𝑚)0 = 0)
35	34	olcs 876	. . . . . . . . 9 ⊢ ((1...𝑚) ∈ Fin → Σ𝑘 ∈ (1...𝑚)0 = 0)
36	33, 35	syl 17	. . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) → Σ𝑘 ∈ (1...𝑚)0 = 0)
37		0nn0 12433	. . . . . . . . . 10 ⊢ 0 ∈ ℕ0
38		elfznn 13490	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (1...𝑚) → 𝑘 ∈ ℕ)
39	38	nnnn0d 12479	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (1...𝑚) → 𝑘 ∈ ℕ0)
40		nn0uz 12811	. . . . . . . . . . . 12 ⊢ ℕ0 = (ℤ≥‘0)
41	39, 40	eleqtrdi 2838	. . . . . . . . . . 11 ⊢ (𝑘 ∈ (1...𝑚) → 𝑘 ∈ (ℤ≥‘0))
42	41	adantl 481	. . . . . . . . . 10 ⊢ (((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) ∧ 𝑘 ∈ (1...𝑚)) → 𝑘 ∈ (ℤ≥‘0))
43		simpll 766	. . . . . . . . . 10 ⊢ (((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) ∧ 𝑘 ∈ (1...𝑚)) → 𝑃 ∈ ℙ)
44		pcfaclem 16845	. . . . . . . . . 10 ⊢ ((0 ∈ ℕ0 ∧ 𝑘 ∈ (ℤ≥‘0) ∧ 𝑃 ∈ ℙ) → (⌊‘(0 / (𝑃↑𝑘))) = 0)
45	37, 42, 43, 44	mp3an2i 1468	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘(0 / (𝑃↑𝑘))) = 0)
46	45	sumeq2dv 15644	. . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) → Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)0)
47		fac0 14217	. . . . . . . . . . 11 ⊢ (!‘0) = 1
48	47	oveq2i 7380	. . . . . . . . . 10 ⊢ (𝑃 pCnt (!‘0)) = (𝑃 pCnt 1)
49		pc1 16802	. . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt 1) = 0)
50	48, 49	eqtrid 2776	. . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt (!‘0)) = 0)
51	50	adantr 480	. . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) → (𝑃 pCnt (!‘0)) = 0)
52	36, 46, 51	3eqtr4rd 2775	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ≥‘0)) → (𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))))
53	52	ralrimiva 3125	. . . . . 6 ⊢ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘0)(𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))))
54		nn0z 12530	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ0 → 𝑛 ∈ ℤ)
55	54	adantr 480	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → 𝑛 ∈ ℤ)
56		uzid 12784	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ (ℤ≥‘𝑛))
57		peano2uz 12836	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ≥‘𝑛) → (𝑛 + 1) ∈ (ℤ≥‘𝑛))
58	55, 56, 57	3syl 18	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → (𝑛 + 1) ∈ (ℤ≥‘𝑛))
59		uzss 12792	. . . . . . . . . 10 ⊢ ((𝑛 + 1) ∈ (ℤ≥‘𝑛) → (ℤ≥‘(𝑛 + 1)) ⊆ (ℤ≥‘𝑛))
60		ssralv 4012	. . . . . . . . . 10 ⊢ ((ℤ≥‘(𝑛 + 1)) ⊆ (ℤ≥‘𝑛) → (∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
61	58, 59, 60	3syl 18	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → (∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
62		oveq1 7376	. . . . . . . . . . 11 ⊢ ((𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))) = (Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) + (𝑃 pCnt (𝑛 + 1))))
63		simpll 766	. . . . . . . . . . . . . . 15 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑛 ∈ ℕ0)
64		facp1 14219	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ0 → (!‘(𝑛 + 1)) = ((!‘𝑛) · (𝑛 + 1)))
65	63, 64	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (!‘(𝑛 + 1)) = ((!‘𝑛) · (𝑛 + 1)))
66	65	oveq2d 7385	. . . . . . . . . . . . 13 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (!‘(𝑛 + 1))) = (𝑃 pCnt ((!‘𝑛) · (𝑛 + 1))))
67		simplr 768	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑃 ∈ ℙ)
68		faccl 14224	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ0 → (!‘𝑛) ∈ ℕ)
69		nnz 12526	. . . . . . . . . . . . . . . 16 ⊢ ((!‘𝑛) ∈ ℕ → (!‘𝑛) ∈ ℤ)
70		nnne0 12196	. . . . . . . . . . . . . . . 16 ⊢ ((!‘𝑛) ∈ ℕ → (!‘𝑛) ≠ 0)
71	69, 70	jca 511	. . . . . . . . . . . . . . 15 ⊢ ((!‘𝑛) ∈ ℕ → ((!‘𝑛) ∈ ℤ ∧ (!‘𝑛) ≠ 0))
72	63, 68, 71	3syl 18	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((!‘𝑛) ∈ ℤ ∧ (!‘𝑛) ≠ 0))
73		nn0p1nn 12457	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ0 → (𝑛 + 1) ∈ ℕ)
74		nnz 12526	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 + 1) ∈ ℕ → (𝑛 + 1) ∈ ℤ)
75		nnne0 12196	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 + 1) ∈ ℕ → (𝑛 + 1) ≠ 0)
76	74, 75	jca 511	. . . . . . . . . . . . . . 15 ⊢ ((𝑛 + 1) ∈ ℕ → ((𝑛 + 1) ∈ ℤ ∧ (𝑛 + 1) ≠ 0))
77	63, 73, 76	3syl 18	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑛 + 1) ∈ ℤ ∧ (𝑛 + 1) ≠ 0))
78		pcmul 16798	. . . . . . . . . . . . . 14 ⊢ ((𝑃 ∈ ℙ ∧ ((!‘𝑛) ∈ ℤ ∧ (!‘𝑛) ≠ 0) ∧ ((𝑛 + 1) ∈ ℤ ∧ (𝑛 + 1) ≠ 0)) → (𝑃 pCnt ((!‘𝑛) · (𝑛 + 1))) = ((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))))
79	67, 72, 77, 78	syl3anc 1373	. . . . . . . . . . . . 13 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt ((!‘𝑛) · (𝑛 + 1))) = ((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))))
80	66, 79	eqtr2d 2765	. . . . . . . . . . . 12 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))) = (𝑃 pCnt (!‘(𝑛 + 1))))
81	63	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑛 ∈ ℕ0)
82	81	nn0zd 12531	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑛 ∈ ℤ)
83		prmnn 16620	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
84	83	ad2antlr 727	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑃 ∈ ℕ)
85		nnexpcl 14015	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ0) → (𝑃↑𝑘) ∈ ℕ)
86	84, 39, 85	syl2an 596	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑃↑𝑘) ∈ ℕ)
87		fldivp1 16844	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 ∈ ℤ ∧ (𝑃↑𝑘) ∈ ℕ) → ((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = if((𝑃↑𝑘) ∥ (𝑛 + 1), 1, 0))
88	82, 86, 87	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → ((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = if((𝑃↑𝑘) ∥ (𝑛 + 1), 1, 0))
89		elfzuz 13457	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (1...𝑚) → 𝑘 ∈ (ℤ≥‘1))
90	63, 73	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑛 + 1) ∈ ℕ)
91	67, 90	pccld 16797	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ∈ ℕ0)
92	91	nn0zd 12531	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ∈ ℤ)
93		elfz5 13453	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑘 ∈ (ℤ≥‘1) ∧ (𝑃 pCnt (𝑛 + 1)) ∈ ℤ) → (𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))) ↔ 𝑘 ≤ (𝑃 pCnt (𝑛 + 1))))
94	89, 92, 93	syl2anr 597	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))) ↔ 𝑘 ≤ (𝑃 pCnt (𝑛 + 1))))
95		simpllr 775	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑃 ∈ ℙ)
96	81, 73	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑛 + 1) ∈ ℕ)
97	96	nnzd 12532	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑛 + 1) ∈ ℤ)
98	39	adantl 481	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑘 ∈ ℕ0)
99		pcdvdsb 16816	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑃 ∈ ℙ ∧ (𝑛 + 1) ∈ ℤ ∧ 𝑘 ∈ ℕ0) → (𝑘 ≤ (𝑃 pCnt (𝑛 + 1)) ↔ (𝑃↑𝑘) ∥ (𝑛 + 1)))
100	95, 97, 98, 99	syl3anc 1373	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑘 ≤ (𝑃 pCnt (𝑛 + 1)) ↔ (𝑃↑𝑘) ∥ (𝑛 + 1)))
101	94, 100	bitr2d 280	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → ((𝑃↑𝑘) ∥ (𝑛 + 1) ↔ 𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1)))))
102	101	ifbid 4508	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → if((𝑃↑𝑘) ∥ (𝑛 + 1), 1, 0) = if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0))
103	88, 102	eqtrd 2764	. . . . . . . . . . . . . . 15 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → ((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0))
104	103	sumeq2dv 15644	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = Σ𝑘 ∈ (1...𝑚)if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0))
105		fzfid 13914	. . . . . . . . . . . . . . 15 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (1...𝑚) ∈ Fin)
106	63	nn0red 12480	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑛 ∈ ℝ)
107		peano2re 11323	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ ℝ → (𝑛 + 1) ∈ ℝ)
108	106, 107	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑛 + 1) ∈ ℝ)
109	108	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑛 + 1) ∈ ℝ)
110	109, 86	nndivred 12216	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → ((𝑛 + 1) / (𝑃↑𝑘)) ∈ ℝ)
111	110	flcld 13736	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘((𝑛 + 1) / (𝑃↑𝑘))) ∈ ℤ)
112	111	zcnd 12615	. . . . . . . . . . . . . . 15 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘((𝑛 + 1) / (𝑃↑𝑘))) ∈ ℂ)
113	106	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑛 ∈ ℝ)
114	113, 86	nndivred 12216	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑛 / (𝑃↑𝑘)) ∈ ℝ)
115	114	flcld 13736	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘(𝑛 / (𝑃↑𝑘))) ∈ ℤ)
116	115	zcnd 12615	. . . . . . . . . . . . . . 15 ⊢ ((((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘(𝑛 / (𝑃↑𝑘))) ∈ ℂ)
117	105, 112, 116	fsumsub 15730	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = (Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
118		fzfi 13913	. . . . . . . . . . . . . . . 16 ⊢ (1...𝑚) ∈ Fin
119	91	nn0red 12480	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ∈ ℝ)
120		eluzelz 12779	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑚 ∈ (ℤ≥‘(𝑛 + 1)) → 𝑚 ∈ ℤ)
121	120	adantl 481	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑚 ∈ ℤ)
122	121	zred 12614	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑚 ∈ ℝ)
123		prmuz2 16642	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ≥‘2))
124	123	ad2antlr 727	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑃 ∈ (ℤ≥‘2))
125	90	nnnn0d 12479	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑛 + 1) ∈ ℕ0)
126		bernneq3 14172	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑃 ∈ (ℤ≥‘2) ∧ (𝑛 + 1) ∈ ℕ0) → (𝑛 + 1) < (𝑃↑(𝑛 + 1)))
127	124, 125, 126	syl2anc 584	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑛 + 1) < (𝑃↑(𝑛 + 1)))
128	119, 108	letrid 11302	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1) ∨ (𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1))))
129	128	ord 864	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (¬ (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1) → (𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1))))
130	90	nnzd 12532	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑛 + 1) ∈ ℤ)
131		pcdvdsb 16816	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑃 ∈ ℙ ∧ (𝑛 + 1) ∈ ℤ ∧ (𝑛 + 1) ∈ ℕ0) → ((𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1)) ↔ (𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1)))
132	67, 130, 125, 131	syl3anc 1373	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1)) ↔ (𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1)))
133	84, 125	nnexpcld 14186	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃↑(𝑛 + 1)) ∈ ℕ)
134	133	nnzd 12532	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃↑(𝑛 + 1)) ∈ ℤ)
135		dvdsle 16256	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑃↑(𝑛 + 1)) ∈ ℤ ∧ (𝑛 + 1) ∈ ℕ) → ((𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1) → (𝑃↑(𝑛 + 1)) ≤ (𝑛 + 1)))
136	134, 90, 135	syl2anc 584	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1) → (𝑃↑(𝑛 + 1)) ≤ (𝑛 + 1)))
137	133	nnred 12177	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃↑(𝑛 + 1)) ∈ ℝ)
138	137, 108	lenltd 11296	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑃↑(𝑛 + 1)) ≤ (𝑛 + 1) ↔ ¬ (𝑛 + 1) < (𝑃↑(𝑛 + 1))))
139	136, 138	sylibd 239	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1) → ¬ (𝑛 + 1) < (𝑃↑(𝑛 + 1))))
140	132, 139	sylbid 240	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1)) → ¬ (𝑛 + 1) < (𝑃↑(𝑛 + 1))))
141	129, 140	syld 47	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (¬ (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1) → ¬ (𝑛 + 1) < (𝑃↑(𝑛 + 1))))
142	127, 141	mt4d 117	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1))
143		eluzle 12782	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑚 ∈ (ℤ≥‘(𝑛 + 1)) → (𝑛 + 1) ≤ 𝑚)
144	143	adantl 481	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑛 + 1) ≤ 𝑚)
145	119, 108, 122, 142, 144	letrd 11307	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ≤ 𝑚)
146		eluz 12783	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑃 pCnt (𝑛 + 1)) ∈ ℤ ∧ 𝑚 ∈ ℤ) → (𝑚 ∈ (ℤ≥‘(𝑃 pCnt (𝑛 + 1))) ↔ (𝑃 pCnt (𝑛 + 1)) ≤ 𝑚))
147	92, 121, 146	syl2anc 584	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑚 ∈ (ℤ≥‘(𝑃 pCnt (𝑛 + 1))) ↔ (𝑃 pCnt (𝑛 + 1)) ≤ 𝑚))
148	145, 147	mpbird 257	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → 𝑚 ∈ (ℤ≥‘(𝑃 pCnt (𝑛 + 1))))
149		fzss2 13501	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 ∈ (ℤ≥‘(𝑃 pCnt (𝑛 + 1))) → (1...(𝑃 pCnt (𝑛 + 1))) ⊆ (1...𝑚))
150	148, 149	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (1...(𝑃 pCnt (𝑛 + 1))) ⊆ (1...𝑚))
151		sumhash 16843	. . . . . . . . . . . . . . . 16 ⊢ (((1...𝑚) ∈ Fin ∧ (1...(𝑃 pCnt (𝑛 + 1))) ⊆ (1...𝑚)) → Σ𝑘 ∈ (1...𝑚)if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0) = (♯‘(1...(𝑃 pCnt (𝑛 + 1)))))
152	118, 150, 151	sylancr 587	. . . . . . . . . . . . . . 15 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0) = (♯‘(1...(𝑃 pCnt (𝑛 + 1)))))
153		hashfz1 14287	. . . . . . . . . . . . . . . 16 ⊢ ((𝑃 pCnt (𝑛 + 1)) ∈ ℕ0 → (♯‘(1...(𝑃 pCnt (𝑛 + 1)))) = (𝑃 pCnt (𝑛 + 1)))
154	91, 153	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (♯‘(1...(𝑃 pCnt (𝑛 + 1)))) = (𝑃 pCnt (𝑛 + 1)))
155	152, 154	eqtrd 2764	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0) = (𝑃 pCnt (𝑛 + 1)))
156	104, 117, 155	3eqtr3d 2772	. . . . . . . . . . . . 13 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))) = (𝑃 pCnt (𝑛 + 1)))
157	105, 112	fsumcl 15675	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))) ∈ ℂ)
158	105, 116	fsumcl 15675	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) ∈ ℂ)
159	119	recnd 11178	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ∈ ℂ)
160	157, 158, 159	subaddd 11527	. . . . . . . . . . . . 13 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))) = (𝑃 pCnt (𝑛 + 1)) ↔ (Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) + (𝑃 pCnt (𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
161	156, 160	mpbid 232	. . . . . . . . . . . 12 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) + (𝑃 pCnt (𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))
162	80, 161	eqeq12d 2745	. . . . . . . . . . 11 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → (((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))) = (Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) + (𝑃 pCnt (𝑛 + 1))) ↔ (𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
163	62, 162	imbitrid 244	. . . . . . . . . 10 ⊢ (((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ≥‘(𝑛 + 1))) → ((𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → (𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
164	163	ralimdva 3145	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → (∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
165	61, 164	syld 47	. . . . . . . 8 ⊢ ((𝑛 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → (∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
166	165	ex 412	. . . . . . 7 ⊢ (𝑛 ∈ ℕ0 → (𝑃 ∈ ℙ → (∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))))
167	166	a2d 29	. . . . . 6 ⊢ (𝑛 ∈ ℕ0 → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))) → (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))))
168	8, 16, 24, 32, 53, 167	nn0ind 12605	. . . . 5 ⊢ (𝑁 ∈ ℕ0 → (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘)))))
169	168	imp 406	. . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → ∀𝑚 ∈ (ℤ≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))))
170		oveq2 7377	. . . . . . 7 ⊢ (𝑚 = 𝑀 → (1...𝑚) = (1...𝑀))
171	170	sumeq1d 15642	. . . . . 6 ⊢ (𝑚 = 𝑀 → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘))))
172	171	eqeq2d 2740	. . . . 5 ⊢ (𝑚 = 𝑀 → ((𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘)))))
173	172	rspcv 3581	. . . 4 ⊢ (𝑀 ∈ (ℤ≥‘𝑁) → (∀𝑚 ∈ (ℤ≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))) → (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘)))))
174	169, 173	syl5 34	. . 3 ⊢ (𝑀 ∈ (ℤ≥‘𝑁) → ((𝑁 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘)))))
175	174	3impib 1116	. 2 ⊢ ((𝑀 ∈ (ℤ≥‘𝑁) ∧ 𝑁 ∈ ℕ0 ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘))))
176	175	3com12 1123	1 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝑀 ∈ (ℤ≥‘𝑁) ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∀wral 3044   ⊆ wss 3911  ifcif 4484   class class class wbr 5102  ‘cfv 6499  (class class class)co 7369  Fincfn 8895  ℝcr 11043  0cc0 11044  1c1 11045   + caddc 11047   · cmul 11049   < clt 11184   ≤ cle 11185   − cmin 11381   / cdiv 11811  ℕcn 12162  2c2 12217  ℕ₀cn0 12418  ℤcz 12505  ℤ_≥cuz 12769  ...cfz 13444  ⌊cfl 13728  ↑cexp 14002  !cfa 14214  ♯chash 14271  Σcsu 15628   ∥ cdvds 16198  ℙcprime 16617   pCnt cpc 16783

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5229  ax-sep 5246  ax-nul 5256  ax-pow 5315  ax-pr 5382  ax-un 7691  ax-inf2 9570  ax-cnex 11100  ax-resscn 11101  ax-1cn 11102  ax-icn 11103  ax-addcl 11104  ax-addrcl 11105  ax-mulcl 11106  ax-mulrcl 11107  ax-mulcom 11108  ax-addass 11109  ax-mulass 11110  ax-distr 11111  ax-i2m1 11112  ax-1ne0 11113  ax-1rid 11114  ax-rnegex 11115  ax-rrecex 11116  ax-cnre 11117  ax-pre-lttri 11118  ax-pre-lttrn 11119  ax-pre-ltadd 11120  ax-pre-mulgt0 11121  ax-pre-sup 11122

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3351  df-reu 3352  df-rab 3403  df-v 3446  df-sbc 3751  df-csb 3860  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-pss 3931  df-nul 4293  df-if 4485  df-pw 4561  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4907  df-iun 4953  df-br 5103  df-opab 5165  df-mpt 5184  df-tr 5210  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-se 5585  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6262  df-ord 6323  df-on 6324  df-lim 6325  df-suc 6326  df-iota 6452  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-isom 6508  df-riota 7326  df-ov 7372  df-oprab 7373  df-mpo 7374  df-om 7823  df-1st 7947  df-2nd 7948  df-frecs 8237  df-wrecs 8268  df-recs 8317  df-rdg 8355  df-1o 8411  df-2o 8412  df-er 8648  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-sup 9369  df-inf 9370  df-oi 9439  df-card 9868  df-pnf 11186  df-mnf 11187  df-xr 11188  df-ltxr 11189  df-le 11190  df-sub 11383  df-neg 11384  df-div 11812  df-nn 12163  df-2 12225  df-3 12226  df-n0 12419  df-z 12506  df-uz 12770  df-q 12884  df-rp 12928  df-fz 13445  df-fzo 13592  df-fl 13730  df-mod 13808  df-seq 13943  df-exp 14003  df-fac 14215  df-hash 14272  df-cj 15041  df-re 15042  df-im 15043  df-sqrt 15177  df-abs 15178  df-clim 15430  df-sum 15629  df-dvds 16199  df-gcd 16441  df-prm 16618  df-pc 16784

This theorem is referenced by:  pcbc  16847