pcfac - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > pcfac		GIF version

Theorem pcfac 12362

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	⊢ ((𝑁 ∈ ℕ₀ ∧ 𝑀 ∈ (ℤ_≥‘𝑁) ∧ 𝑃 ∈ ℙ) → (𝑃 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 5527	. . . . . . . 8 ⊢ (𝑥 = 0 → (ℤ_≥‘𝑥) = (ℤ_≥‘0))
2		fveq2 5527	. . . . . . . . . 10 ⊢ (𝑥 = 0 → (!‘𝑥) = (!‘0))
3	2	oveq2d 5904	. . . . . . . . 9 ⊢ (𝑥 = 0 → (𝑃 pCnt (!‘𝑥)) = (𝑃 pCnt (!‘0)))
4		fvoveq1 5911	. . . . . . . . . 10 ⊢ (𝑥 = 0 → (⌊‘(𝑥 / (𝑃↑𝑘))) = (⌊‘(0 / (𝑃↑𝑘))))
5	4	sumeq2sdv 11392	. . . . . . . . 9 ⊢ (𝑥 = 0 → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))))
6	3, 5	eqeq12d 2202	. . . . . . . 8 ⊢ (𝑥 = 0 → ((𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘)))))
7	1, 6	raleqbidv 2695	. . . . . . 7 ⊢ (𝑥 = 0 → (∀𝑚 ∈ (ℤ_≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ ∀𝑚 ∈ (ℤ_≥‘0)(𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘)))))
8	7	imbi2d 230	. . . . . 6 ⊢ (𝑥 = 0 → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ_≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘)))) ↔ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ_≥‘0)(𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))))))
9		fveq2 5527	. . . . . . . 8 ⊢ (𝑥 = 𝑛 → (ℤ_≥‘𝑥) = (ℤ_≥‘𝑛))
10		fveq2 5527	. . . . . . . . . 10 ⊢ (𝑥 = 𝑛 → (!‘𝑥) = (!‘𝑛))
11	10	oveq2d 5904	. . . . . . . . 9 ⊢ (𝑥 = 𝑛 → (𝑃 pCnt (!‘𝑥)) = (𝑃 pCnt (!‘𝑛)))
12		fvoveq1 5911	. . . . . . . . . 10 ⊢ (𝑥 = 𝑛 → (⌊‘(𝑥 / (𝑃↑𝑘))) = (⌊‘(𝑛 / (𝑃↑𝑘))))
13	12	sumeq2sdv 11392	. . . . . . . . 9 ⊢ (𝑥 = 𝑛 → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))))
14	11, 13	eqeq12d 2202	. . . . . . . 8 ⊢ (𝑥 = 𝑛 → ((𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
15	9, 14	raleqbidv 2695	. . . . . . 7 ⊢ (𝑥 = 𝑛 → (∀𝑚 ∈ (ℤ_≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ ∀𝑚 ∈ (ℤ_≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
16	15	imbi2d 230	. . . . . 6 ⊢ (𝑥 = 𝑛 → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ_≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘)))) ↔ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ_≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))))))
17		fveq2 5527	. . . . . . . 8 ⊢ (𝑥 = (𝑛 + 1) → (ℤ_≥‘𝑥) = (ℤ_≥‘(𝑛 + 1)))
18		fveq2 5527	. . . . . . . . . 10 ⊢ (𝑥 = (𝑛 + 1) → (!‘𝑥) = (!‘(𝑛 + 1)))
19	18	oveq2d 5904	. . . . . . . . 9 ⊢ (𝑥 = (𝑛 + 1) → (𝑃 pCnt (!‘𝑥)) = (𝑃 pCnt (!‘(𝑛 + 1))))
20		fvoveq1 5911	. . . . . . . . . 10 ⊢ (𝑥 = (𝑛 + 1) → (⌊‘(𝑥 / (𝑃↑𝑘))) = (⌊‘((𝑛 + 1) / (𝑃↑𝑘))))
21	20	sumeq2sdv 11392	. . . . . . . . 9 ⊢ (𝑥 = (𝑛 + 1) → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))
22	19, 21	eqeq12d 2202	. . . . . . . 8 ⊢ (𝑥 = (𝑛 + 1) → ((𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
23	17, 22	raleqbidv 2695	. . . . . . 7 ⊢ (𝑥 = (𝑛 + 1) → (∀𝑚 ∈ (ℤ_≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ ∀𝑚 ∈ (ℤ_≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
24	23	imbi2d 230	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ_≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘)))) ↔ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ_≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))))
25		fveq2 5527	. . . . . . . 8 ⊢ (𝑥 = 𝑁 → (ℤ_≥‘𝑥) = (ℤ_≥‘𝑁))
26		fveq2 5527	. . . . . . . . . 10 ⊢ (𝑥 = 𝑁 → (!‘𝑥) = (!‘𝑁))
27	26	oveq2d 5904	. . . . . . . . 9 ⊢ (𝑥 = 𝑁 → (𝑃 pCnt (!‘𝑥)) = (𝑃 pCnt (!‘𝑁)))
28		fvoveq1 5911	. . . . . . . . . 10 ⊢ (𝑥 = 𝑁 → (⌊‘(𝑥 / (𝑃↑𝑘))) = (⌊‘(𝑁 / (𝑃↑𝑘))))
29	28	sumeq2sdv 11392	. . . . . . . . 9 ⊢ (𝑥 = 𝑁 → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))))
30	27, 29	eqeq12d 2202	. . . . . . . 8 ⊢ (𝑥 = 𝑁 → ((𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘)))))
31	25, 30	raleqbidv 2695	. . . . . . 7 ⊢ (𝑥 = 𝑁 → (∀𝑚 ∈ (ℤ_≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘))) ↔ ∀𝑚 ∈ (ℤ_≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘)))))
32	31	imbi2d 230	. . . . . 6 ⊢ (𝑥 = 𝑁 → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ_≥‘𝑥)(𝑃 pCnt (!‘𝑥)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑥 / (𝑃↑𝑘)))) ↔ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ_≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))))))
33		1zzd 9294	. . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ_≥‘0)) → 1 ∈ ℤ)
34		eluzelz 9551	. . . . . . . . . . 11 ⊢ (𝑚 ∈ (ℤ_≥‘0) → 𝑚 ∈ ℤ)
35	34	adantl 277	. . . . . . . . . 10 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ_≥‘0)) → 𝑚 ∈ ℤ)
36	33, 35	fzfigd 10445	. . . . . . . . 9 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ_≥‘0)) → (1...𝑚) ∈ Fin)
37		isumz 11411	. . . . . . . . . 10 ⊢ (((1 ∈ ℤ ∧ (1...𝑚) ⊆ (ℤ_≥‘1) ∧ ∀𝑗 ∈ (ℤ_≥‘1)DECID 𝑗 ∈ (1...𝑚)) ∨ (1...𝑚) ∈ Fin) → Σ𝑘 ∈ (1...𝑚)0 = 0)
38	37	olcs 737	. . . . . . . . 9 ⊢ ((1...𝑚) ∈ Fin → Σ𝑘 ∈ (1...𝑚)0 = 0)
39	36, 38	syl 14	. . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ_≥‘0)) → Σ𝑘 ∈ (1...𝑚)0 = 0)
40		0nn0 9205	. . . . . . . . . 10 ⊢ 0 ∈ ℕ₀
41		elfznn 10068	. . . . . . . . . . . . 13 ⊢ (𝑘 ∈ (1...𝑚) → 𝑘 ∈ ℕ)
42	41	nnnn0d 9243	. . . . . . . . . . . 12 ⊢ (𝑘 ∈ (1...𝑚) → 𝑘 ∈ ℕ₀)
43		nn0uz 9576	. . . . . . . . . . . 12 ⊢ ℕ₀ = (ℤ_≥‘0)
44	42, 43	eleqtrdi 2280	. . . . . . . . . . 11 ⊢ (𝑘 ∈ (1...𝑚) → 𝑘 ∈ (ℤ_≥‘0))
45	44	adantl 277	. . . . . . . . . 10 ⊢ (((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ_≥‘0)) ∧ 𝑘 ∈ (1...𝑚)) → 𝑘 ∈ (ℤ_≥‘0))
46		simpll 527	. . . . . . . . . 10 ⊢ (((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ_≥‘0)) ∧ 𝑘 ∈ (1...𝑚)) → 𝑃 ∈ ℙ)
47		pcfaclem 12361	. . . . . . . . . 10 ⊢ ((0 ∈ ℕ₀ ∧ 𝑘 ∈ (ℤ_≥‘0) ∧ 𝑃 ∈ ℙ) → (⌊‘(0 / (𝑃↑𝑘))) = 0)
48	40, 45, 46, 47	mp3an2i 1352	. . . . . . . . 9 ⊢ (((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ_≥‘0)) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘(0 / (𝑃↑𝑘))) = 0)
49	48	sumeq2dv 11390	. . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ_≥‘0)) → Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑚)0)
50		fac0 10722	. . . . . . . . . . 11 ⊢ (!‘0) = 1
51	50	oveq2i 5899	. . . . . . . . . 10 ⊢ (𝑃 pCnt (!‘0)) = (𝑃 pCnt 1)
52		pc1 12319	. . . . . . . . . 10 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt 1) = 0)
53	51, 52	eqtrid 2232	. . . . . . . . 9 ⊢ (𝑃 ∈ ℙ → (𝑃 pCnt (!‘0)) = 0)
54	53	adantr 276	. . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ_≥‘0)) → (𝑃 pCnt (!‘0)) = 0)
55	39, 49, 54	3eqtr4rd 2231	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝑚 ∈ (ℤ_≥‘0)) → (𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))))
56	55	ralrimiva 2560	. . . . . 6 ⊢ (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ_≥‘0)(𝑃 pCnt (!‘0)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(0 / (𝑃↑𝑘))))
57		nn0z 9287	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ℕ₀ → 𝑛 ∈ ℤ)
58	57	adantr 276	. . . . . . . . . . 11 ⊢ ((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) → 𝑛 ∈ ℤ)
59		uzid 9556	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ℤ → 𝑛 ∈ (ℤ_≥‘𝑛))
60		peano2uz 9597	. . . . . . . . . . 11 ⊢ (𝑛 ∈ (ℤ_≥‘𝑛) → (𝑛 + 1) ∈ (ℤ_≥‘𝑛))
61	58, 59, 60	3syl 17	. . . . . . . . . 10 ⊢ ((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) → (𝑛 + 1) ∈ (ℤ_≥‘𝑛))
62		uzss 9562	. . . . . . . . . 10 ⊢ ((𝑛 + 1) ∈ (ℤ_≥‘𝑛) → (ℤ_≥‘(𝑛 + 1)) ⊆ (ℤ_≥‘𝑛))
63		ssralv 3231	. . . . . . . . . 10 ⊢ ((ℤ_≥‘(𝑛 + 1)) ⊆ (ℤ_≥‘𝑛) → (∀𝑚 ∈ (ℤ_≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ_≥‘(𝑛 + 1))(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
64	61, 62, 63	3syl 17	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) → (∀𝑚 ∈ (ℤ_≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ_≥‘(𝑛 + 1))(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
65		oveq1 5895	. . . . . . . . . . 11 ⊢ ((𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))) = (Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) + (𝑃 pCnt (𝑛 + 1))))
66		simpll 527	. . . . . . . . . . . . . . 15 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → 𝑛 ∈ ℕ₀)
67		facp1 10724	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ₀ → (!‘(𝑛 + 1)) = ((!‘𝑛) · (𝑛 + 1)))
68	66, 67	syl 14	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (!‘(𝑛 + 1)) = ((!‘𝑛) · (𝑛 + 1)))
69	68	oveq2d 5904	. . . . . . . . . . . . 13 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑃 pCnt (!‘(𝑛 + 1))) = (𝑃 pCnt ((!‘𝑛) · (𝑛 + 1))))
70		simplr 528	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → 𝑃 ∈ ℙ)
71		faccl 10729	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ₀ → (!‘𝑛) ∈ ℕ)
72		nnz 9286	. . . . . . . . . . . . . . . 16 ⊢ ((!‘𝑛) ∈ ℕ → (!‘𝑛) ∈ ℤ)
73		nnne0 8961	. . . . . . . . . . . . . . . 16 ⊢ ((!‘𝑛) ∈ ℕ → (!‘𝑛) ≠ 0)
74	72, 73	jca 306	. . . . . . . . . . . . . . 15 ⊢ ((!‘𝑛) ∈ ℕ → ((!‘𝑛) ∈ ℤ ∧ (!‘𝑛) ≠ 0))
75	66, 71, 74	3syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → ((!‘𝑛) ∈ ℤ ∧ (!‘𝑛) ≠ 0))
76		nn0p1nn 9229	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ₀ → (𝑛 + 1) ∈ ℕ)
77		nnz 9286	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 + 1) ∈ ℕ → (𝑛 + 1) ∈ ℤ)
78		nnne0 8961	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 + 1) ∈ ℕ → (𝑛 + 1) ≠ 0)
79	77, 78	jca 306	. . . . . . . . . . . . . . 15 ⊢ ((𝑛 + 1) ∈ ℕ → ((𝑛 + 1) ∈ ℤ ∧ (𝑛 + 1) ≠ 0))
80	66, 76, 79	3syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → ((𝑛 + 1) ∈ ℤ ∧ (𝑛 + 1) ≠ 0))
81		pcmul 12315	. . . . . . . . . . . . . 14 ⊢ ((𝑃 ∈ ℙ ∧ ((!‘𝑛) ∈ ℤ ∧ (!‘𝑛) ≠ 0) ∧ ((𝑛 + 1) ∈ ℤ ∧ (𝑛 + 1) ≠ 0)) → (𝑃 pCnt ((!‘𝑛) · (𝑛 + 1))) = ((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))))
82	70, 75, 80, 81	syl3anc 1248	. . . . . . . . . . . . 13 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑃 pCnt ((!‘𝑛) · (𝑛 + 1))) = ((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))))
83	69, 82	eqtr2d 2221	. . . . . . . . . . . 12 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → ((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))) = (𝑃 pCnt (!‘(𝑛 + 1))))
84	66	adantr 276	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑛 ∈ ℕ₀)
85	84	nn0zd 9387	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑛 ∈ ℤ)
86		prmnn 12124	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
87	86	ad2antlr 489	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → 𝑃 ∈ ℕ)
88		nnexpcl 10547	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑃 ∈ ℕ ∧ 𝑘 ∈ ℕ₀) → (𝑃↑𝑘) ∈ ℕ)
89	87, 42, 88	syl2an 289	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑃↑𝑘) ∈ ℕ)
90		fldivp1 12360	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑛 ∈ ℤ ∧ (𝑃↑𝑘) ∈ ℕ) → ((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = if((𝑃↑𝑘) ∥ (𝑛 + 1), 1, 0))
91	85, 89, 90	syl2anc 411	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → ((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = if((𝑃↑𝑘) ∥ (𝑛 + 1), 1, 0))
92		elfzuz 10035	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (1...𝑚) → 𝑘 ∈ (ℤ_≥‘1))
93	66, 76	syl 14	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑛 + 1) ∈ ℕ)
94	70, 93	pccld 12314	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ∈ ℕ₀)
95	94	nn0zd 9387	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ∈ ℤ)
96		elfz5 10031	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑘 ∈ (ℤ_≥‘1) ∧ (𝑃 pCnt (𝑛 + 1)) ∈ ℤ) → (𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))) ↔ 𝑘 ≤ (𝑃 pCnt (𝑛 + 1))))
97	92, 95, 96	syl2anr 290	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))) ↔ 𝑘 ≤ (𝑃 pCnt (𝑛 + 1))))
98		simpllr 534	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑃 ∈ ℙ)
99	84, 76	syl 14	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑛 + 1) ∈ ℕ)
100	99	nnzd 9388	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑛 + 1) ∈ ℤ)
101	42	adantl 277	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → 𝑘 ∈ ℕ₀)
102		pcdvdsb 12333	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑃 ∈ ℙ ∧ (𝑛 + 1) ∈ ℤ ∧ 𝑘 ∈ ℕ₀) → (𝑘 ≤ (𝑃 pCnt (𝑛 + 1)) ↔ (𝑃↑𝑘) ∥ (𝑛 + 1)))
103	98, 100, 101, 102	syl3anc 1248	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑘 ≤ (𝑃 pCnt (𝑛 + 1)) ↔ (𝑃↑𝑘) ∥ (𝑛 + 1)))
104	97, 103	bitr2d 189	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → ((𝑃↑𝑘) ∥ (𝑛 + 1) ↔ 𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1)))))
105	104	ifbid 3567	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → if((𝑃↑𝑘) ∥ (𝑛 + 1), 1, 0) = if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0))
106	91, 105	eqtrd 2220	. . . . . . . . . . . . . . 15 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → ((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0))
107	106	sumeq2dv 11390	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = Σ𝑘 ∈ (1...𝑚)if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0))
108		1zzd 9294	. . . . . . . . . . . . . . . 16 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → 1 ∈ ℤ)
109		eluzelz 9551	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 ∈ (ℤ_≥‘(𝑛 + 1)) → 𝑚 ∈ ℤ)
110	109	adantl 277	. . . . . . . . . . . . . . . 16 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → 𝑚 ∈ ℤ)
111	108, 110	fzfigd 10445	. . . . . . . . . . . . . . 15 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (1...𝑚) ∈ Fin)
112		znq 9638	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑛 + 1) ∈ ℤ ∧ (𝑃↑𝑘) ∈ ℕ) → ((𝑛 + 1) / (𝑃↑𝑘)) ∈ ℚ)
113	100, 89, 112	syl2anc 411	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → ((𝑛 + 1) / (𝑃↑𝑘)) ∈ ℚ)
114	113	flqcld 10291	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘((𝑛 + 1) / (𝑃↑𝑘))) ∈ ℤ)
115	114	zcnd 9390	. . . . . . . . . . . . . . 15 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘((𝑛 + 1) / (𝑃↑𝑘))) ∈ ℂ)
116		znq 9638	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑛 ∈ ℤ ∧ (𝑃↑𝑘) ∈ ℕ) → (𝑛 / (𝑃↑𝑘)) ∈ ℚ)
117	85, 89, 116	syl2anc 411	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (𝑛 / (𝑃↑𝑘)) ∈ ℚ)
118	117	flqcld 10291	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘(𝑛 / (𝑃↑𝑘))) ∈ ℤ)
119	118	zcnd 9390	. . . . . . . . . . . . . . 15 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑘 ∈ (1...𝑚)) → (⌊‘(𝑛 / (𝑃↑𝑘))) ∈ ℂ)
120	111, 115, 119	fsumsub 11474	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)((⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − (⌊‘(𝑛 / (𝑃↑𝑘)))) = (Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))))
121	94	nn0red 9244	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ∈ ℝ)
122	66	nn0red 9244	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → 𝑛 ∈ ℝ)
123		peano2re 8107	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑛 ∈ ℝ → (𝑛 + 1) ∈ ℝ)
124	122, 123	syl 14	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑛 + 1) ∈ ℝ)
125	110	zred 9389	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → 𝑚 ∈ ℝ)
126	93	nnzd 9388	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑛 + 1) ∈ ℤ)
127		zdcle 9343	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑃 pCnt (𝑛 + 1)) ∈ ℤ ∧ (𝑛 + 1) ∈ ℤ) → DECID (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1))
128	95, 126, 127	syl2anc 411	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → DECID (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1))
129		zletric 9311	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑃 pCnt (𝑛 + 1)) ∈ ℤ ∧ (𝑛 + 1) ∈ ℤ) → ((𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1) ∨ (𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1))))
130	95, 126, 129	syl2anc 411	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → ((𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1) ∨ (𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1))))
131	130	ord 725	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (¬ (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1) → (𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1))))
132	93	nnnn0d 9243	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑛 + 1) ∈ ℕ₀)
133		pcdvdsb 12333	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑃 ∈ ℙ ∧ (𝑛 + 1) ∈ ℤ ∧ (𝑛 + 1) ∈ ℕ₀) → ((𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1)) ↔ (𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1)))
134	70, 126, 132, 133	syl3anc 1248	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → ((𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1)) ↔ (𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1)))
135	87, 132	nnexpcld 10690	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑃↑(𝑛 + 1)) ∈ ℕ)
136	135	nnzd 9388	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑃↑(𝑛 + 1)) ∈ ℤ)
137		dvdsle 11864	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑃↑(𝑛 + 1)) ∈ ℤ ∧ (𝑛 + 1) ∈ ℕ) → ((𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1) → (𝑃↑(𝑛 + 1)) ≤ (𝑛 + 1)))
138	136, 93, 137	syl2anc 411	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → ((𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1) → (𝑃↑(𝑛 + 1)) ≤ (𝑛 + 1)))
139	135	nnred 8946	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑃↑(𝑛 + 1)) ∈ ℝ)
140	139, 124	lenltd 8089	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → ((𝑃↑(𝑛 + 1)) ≤ (𝑛 + 1) ↔ ¬ (𝑛 + 1) < (𝑃↑(𝑛 + 1))))
141	138, 140	sylibd 149	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → ((𝑃↑(𝑛 + 1)) ∥ (𝑛 + 1) → ¬ (𝑛 + 1) < (𝑃↑(𝑛 + 1))))
142	134, 141	sylbid 150	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → ((𝑛 + 1) ≤ (𝑃 pCnt (𝑛 + 1)) → ¬ (𝑛 + 1) < (𝑃↑(𝑛 + 1))))
143	131, 142	syld 45	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (¬ (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1) → ¬ (𝑛 + 1) < (𝑃↑(𝑛 + 1))))
144		prmuz2 12145	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ_≥‘2))
145	144	ad2antlr 489	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → 𝑃 ∈ (ℤ_≥‘2))
146		bernneq3 10657	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑃 ∈ (ℤ_≥‘2) ∧ (𝑛 + 1) ∈ ℕ₀) → (𝑛 + 1) < (𝑃↑(𝑛 + 1)))
147	145, 132, 146	syl2anc 411	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑛 + 1) < (𝑃↑(𝑛 + 1)))
148		condc 854	. . . . . . . . . . . . . . . . . . . 20 ⊢ (DECID (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1) → ((¬ (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1) → ¬ (𝑛 + 1) < (𝑃↑(𝑛 + 1))) → ((𝑛 + 1) < (𝑃↑(𝑛 + 1)) → (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1))))
149	128, 143, 147, 148	syl3c 63	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ≤ (𝑛 + 1))
150		eluzle 9554	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑚 ∈ (ℤ_≥‘(𝑛 + 1)) → (𝑛 + 1) ≤ 𝑚)
151	150	adantl 277	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑛 + 1) ≤ 𝑚)
152	121, 124, 125, 149, 151	letrd 8095	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ≤ 𝑚)
153		eluz 9555	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑃 pCnt (𝑛 + 1)) ∈ ℤ ∧ 𝑚 ∈ ℤ) → (𝑚 ∈ (ℤ_≥‘(𝑃 pCnt (𝑛 + 1))) ↔ (𝑃 pCnt (𝑛 + 1)) ≤ 𝑚))
154	95, 110, 153	syl2anc 411	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑚 ∈ (ℤ_≥‘(𝑃 pCnt (𝑛 + 1))) ↔ (𝑃 pCnt (𝑛 + 1)) ≤ 𝑚))
155	152, 154	mpbird 167	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → 𝑚 ∈ (ℤ_≥‘(𝑃 pCnt (𝑛 + 1))))
156		fzss2 10078	. . . . . . . . . . . . . . . . 17 ⊢ (𝑚 ∈ (ℤ_≥‘(𝑃 pCnt (𝑛 + 1))) → (1...(𝑃 pCnt (𝑛 + 1))) ⊆ (1...𝑚))
157	155, 156	syl 14	. . . . . . . . . . . . . . . 16 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (1...(𝑃 pCnt (𝑛 + 1))) ⊆ (1...𝑚))
158		elfzelz 10039	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑗 ∈ (1...𝑚) → 𝑗 ∈ ℤ)
159	158	adantl 277	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑗 ∈ (1...𝑚)) → 𝑗 ∈ ℤ)
160		1zzd 9294	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑗 ∈ (1...𝑚)) → 1 ∈ ℤ)
161	95	adantr 276	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑗 ∈ (1...𝑚)) → (𝑃 pCnt (𝑛 + 1)) ∈ ℤ)
162		fzdcel 10054	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑗 ∈ ℤ ∧ 1 ∈ ℤ ∧ (𝑃 pCnt (𝑛 + 1)) ∈ ℤ) → DECID 𝑗 ∈ (1...(𝑃 pCnt (𝑛 + 1))))
163	159, 160, 161, 162	syl3anc 1248	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) ∧ 𝑗 ∈ (1...𝑚)) → DECID 𝑗 ∈ (1...(𝑃 pCnt (𝑛 + 1))))
164	163	ralrimiva 2560	. . . . . . . . . . . . . . . 16 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → ∀𝑗 ∈ (1...𝑚)DECID 𝑗 ∈ (1...(𝑃 pCnt (𝑛 + 1))))
165		sumhashdc 12359	. . . . . . . . . . . . . . . 16 ⊢ (((1...𝑚) ∈ Fin ∧ (1...(𝑃 pCnt (𝑛 + 1))) ⊆ (1...𝑚) ∧ ∀𝑗 ∈ (1...𝑚)DECID 𝑗 ∈ (1...(𝑃 pCnt (𝑛 + 1)))) → Σ𝑘 ∈ (1...𝑚)if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0) = (♯‘(1...(𝑃 pCnt (𝑛 + 1)))))
166	111, 157, 164, 165	syl3anc 1248	. . . . . . . . . . . . . . 15 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0) = (♯‘(1...(𝑃 pCnt (𝑛 + 1)))))
167		hashfz1 10777	. . . . . . . . . . . . . . . 16 ⊢ ((𝑃 pCnt (𝑛 + 1)) ∈ ℕ₀ → (♯‘(1...(𝑃 pCnt (𝑛 + 1)))) = (𝑃 pCnt (𝑛 + 1)))
168	94, 167	syl 14	. . . . . . . . . . . . . . 15 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (♯‘(1...(𝑃 pCnt (𝑛 + 1)))) = (𝑃 pCnt (𝑛 + 1)))
169	166, 168	eqtrd 2220	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)if(𝑘 ∈ (1...(𝑃 pCnt (𝑛 + 1))), 1, 0) = (𝑃 pCnt (𝑛 + 1)))
170	107, 120, 169	3eqtr3d 2228	. . . . . . . . . . . . 13 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))) = (𝑃 pCnt (𝑛 + 1)))
171	111, 115	fsumcl 11422	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))) ∈ ℂ)
172	111, 119	fsumcl 11422	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) ∈ ℂ)
173	94	nn0cnd 9245	. . . . . . . . . . . . . 14 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (𝑃 pCnt (𝑛 + 1)) ∈ ℂ)
174	171, 172, 173	subaddd 8300	. . . . . . . . . . . . 13 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → ((Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))) − Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))) = (𝑃 pCnt (𝑛 + 1)) ↔ (Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) + (𝑃 pCnt (𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
175	170, 174	mpbid 147	. . . . . . . . . . . 12 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) + (𝑃 pCnt (𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))
176	83, 175	eqeq12d 2202	. . . . . . . . . . 11 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → (((𝑃 pCnt (!‘𝑛)) + (𝑃 pCnt (𝑛 + 1))) = (Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) + (𝑃 pCnt (𝑛 + 1))) ↔ (𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
177	65, 176	imbitrid 154	. . . . . . . . . 10 ⊢ (((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) ∧ 𝑚 ∈ (ℤ_≥‘(𝑛 + 1))) → ((𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → (𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
178	177	ralimdva 2554	. . . . . . . . 9 ⊢ ((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) → (∀𝑚 ∈ (ℤ_≥‘(𝑛 + 1))(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ_≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
179	64, 178	syld 45	. . . . . . . 8 ⊢ ((𝑛 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) → (∀𝑚 ∈ (ℤ_≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ_≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘)))))
180	179	ex 115	. . . . . . 7 ⊢ (𝑛 ∈ ℕ₀ → (𝑃 ∈ ℙ → (∀𝑚 ∈ (ℤ_≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘))) → ∀𝑚 ∈ (ℤ_≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))))
181	180	a2d 26	. . . . . 6 ⊢ (𝑛 ∈ ℕ₀ → ((𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ_≥‘𝑛)(𝑃 pCnt (!‘𝑛)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑛 / (𝑃↑𝑘)))) → (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ_≥‘(𝑛 + 1))(𝑃 pCnt (!‘(𝑛 + 1))) = Σ𝑘 ∈ (1...𝑚)(⌊‘((𝑛 + 1) / (𝑃↑𝑘))))))
182	8, 16, 24, 32, 56, 181	nn0ind 9381	. . . . 5 ⊢ (𝑁 ∈ ℕ₀ → (𝑃 ∈ ℙ → ∀𝑚 ∈ (ℤ_≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘)))))
183	182	imp 124	. . . 4 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) → ∀𝑚 ∈ (ℤ_≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))))
184		oveq2 5896	. . . . . . 7 ⊢ (𝑚 = 𝑀 → (1...𝑚) = (1...𝑀))
185	184	sumeq1d 11388	. . . . . 6 ⊢ (𝑚 = 𝑀 → Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘))))
186	185	eqeq2d 2199	. . . . 5 ⊢ (𝑚 = 𝑀 → ((𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))) ↔ (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘)))))
187	186	rspcv 2849	. . . 4 ⊢ (𝑀 ∈ (ℤ_≥‘𝑁) → (∀𝑚 ∈ (ℤ_≥‘𝑁)(𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑚)(⌊‘(𝑁 / (𝑃↑𝑘))) → (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘)))))
188	183, 187	syl5 32	. . 3 ⊢ (𝑀 ∈ (ℤ_≥‘𝑁) → ((𝑁 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘)))))
189	188	3impib 1202	. 2 ⊢ ((𝑀 ∈ (ℤ_≥‘𝑁) ∧ 𝑁 ∈ ℕ₀ ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘))))
190	189	3com12 1208	1 ⊢ ((𝑁 ∈ ℕ₀ ∧ 𝑀 ∈ (ℤ_≥‘𝑁) ∧ 𝑃 ∈ ℙ) → (𝑃 pCnt (!‘𝑁)) = Σ𝑘 ∈ (1...𝑀)(⌊‘(𝑁 / (𝑃↑𝑘))))

Colors of variables: wff set class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 709 DECID wdc 835 ∧ w3a 979 = wceq 1363 ∈ wcel 2158 ≠ wne 2357 ∀wral 2465 ⊆ wss 3141 ifcif 3546 class class class wbr 4015 ‘cfv 5228 (class class class)co 5888 Fincfn 6754 ℝcr 7824 0cc0 7825 1c1 7826 + caddc 7828 · cmul 7830 < clt 8006 ≤ cle 8007 − cmin 8142 / cdiv 8643 ℕcn 8933 2c2 8984 ℕ₀cn0 9190 ℤcz 9267 ℤ_≥cuz 9542 ℚcq 9633 ...cfz 10022 ⌊cfl 10282 ↑cexp 10533 !cfa 10719 ♯chash 10769 Σcsu 11375 ∥ cdvds 11808 ℙcprime 12121 pCnt cpc 12298

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1457 ax-7 1458 ax-gen 1459 ax-ie1 1503 ax-ie2 1504 ax-8 1514 ax-10 1515 ax-11 1516 ax-i12 1517 ax-bndl 1519 ax-4 1520 ax-17 1536 ax-i9 1540 ax-ial 1544 ax-i5r 1545 ax-13 2160 ax-14 2161 ax-ext 2169 ax-coll 4130 ax-sep 4133 ax-nul 4141 ax-pow 4186 ax-pr 4221 ax-un 4445 ax-setind 4548 ax-iinf 4599 ax-cnex 7916 ax-resscn 7917 ax-1cn 7918 ax-1re 7919 ax-icn 7920 ax-addcl 7921 ax-addrcl 7922 ax-mulcl 7923 ax-mulrcl 7924 ax-addcom 7925 ax-mulcom 7926 ax-addass 7927 ax-mulass 7928 ax-distr 7929 ax-i2m1 7930 ax-0lt1 7931 ax-1rid 7932 ax-0id 7933 ax-rnegex 7934 ax-precex 7935 ax-cnre 7936 ax-pre-ltirr 7937 ax-pre-ltwlin 7938 ax-pre-lttrn 7939 ax-pre-apti 7940 ax-pre-ltadd 7941 ax-pre-mulgt0 7942 ax-pre-mulext 7943 ax-arch 7944 ax-caucvg 7945

This theorem depends on definitions: df-bi 117 df-stab 832 df-dc 836 df-3or 980 df-3an 981 df-tru 1366 df-fal 1369 df-nf 1471 df-sb 1773 df-eu 2039 df-mo 2040 df-clab 2174 df-cleq 2180 df-clel 2183 df-nfc 2318 df-ne 2358 df-nel 2453 df-ral 2470 df-rex 2471 df-reu 2472 df-rmo 2473 df-rab 2474 df-v 2751 df-sbc 2975 df-csb 3070 df-dif 3143 df-un 3145 df-in 3147 df-ss 3154 df-nul 3435 df-if 3547 df-pw 3589 df-sn 3610 df-pr 3611 df-op 3613 df-uni 3822 df-int 3857 df-iun 3900 df-br 4016 df-opab 4077 df-mpt 4078 df-tr 4114 df-id 4305 df-po 4308 df-iso 4309 df-iord 4378 df-on 4380 df-ilim 4381 df-suc 4383 df-iom 4602 df-xp 4644 df-rel 4645 df-cnv 4646 df-co 4647 df-dm 4648 df-rn 4649 df-res 4650 df-ima 4651 df-iota 5190 df-fun 5230 df-fn 5231 df-f 5232 df-f1 5233 df-fo 5234 df-f1o 5235 df-fv 5236 df-isom 5237 df-riota 5844 df-ov 5891 df-oprab 5892 df-mpo 5893 df-1st 6155 df-2nd 6156 df-recs 6320 df-irdg 6385 df-frec 6406 df-1o 6431 df-2o 6432 df-oadd 6435 df-er 6549 df-en 6755 df-dom 6756 df-fin 6757 df-sup 6997 df-inf 6998 df-pnf 8008 df-mnf 8009 df-xr 8010 df-ltxr 8011 df-le 8012 df-sub 8144 df-neg 8145 df-reap 8546 df-ap 8553 df-div 8644 df-inn 8934 df-2 8992 df-3 8993 df-4 8994 df-n0 9191 df-z 9268 df-uz 9543 df-q 9634 df-rp 9668 df-fz 10023 df-fzo 10157 df-fl 10284 df-mod 10337 df-seqfrec 10460 df-exp 10534 df-fac 10720 df-ihash 10770 df-cj 10865 df-re 10866 df-im 10867 df-rsqrt 11021 df-abs 11022 df-clim 11301 df-sumdc 11376 df-dvds 11809 df-gcd 11958 df-prm 12122 df-pc 12299

This theorem is referenced by: pcbc 12363

W3C validator