chtdif - Metamath Proof Explorer

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

Theorem chtdif 26662

Description: The difference of the Chebyshev function at two points sums the logarithms of the primes in an interval. (Contributed by Mario Carneiro, 22-Sep-2014.)

**Assertion**
Ref	Expression
chtdif	⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((θ‘𝑁) − (θ‘𝑀)) = Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝))

Distinct variable groups: 𝑀,𝑝 𝑁,𝑝

**Proof of Theorem chtdif**
Step	Hyp	Ref	Expression
1		eluzelre 12833	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ ℝ)
2		chtval 26614	. . . . 5 ⊢ (𝑁 ∈ ℝ → (θ‘𝑁) = Σ𝑝 ∈ ((0[,]𝑁) ∩ ℙ)(log‘𝑝))
3	1, 2	syl 17	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (θ‘𝑁) = Σ𝑝 ∈ ((0[,]𝑁) ∩ ℙ)(log‘𝑝))
4		eluzel2 12827	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℤ)
5		2z 12594	. . . . . . . . . 10 ⊢ 2 ∈ ℤ
6		ifcl 4574	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 2 ∈ ℤ) → if(𝑀 ≤ 2, 𝑀, 2) ∈ ℤ)
7	4, 5, 6	sylancl 587	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → if(𝑀 ≤ 2, 𝑀, 2) ∈ ℤ)
8	5	a1i 11	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 2 ∈ ℤ)
9	4	zred 12666	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℝ)
10		2re 12286	. . . . . . . . . 10 ⊢ 2 ∈ ℝ
11		min2 13169	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℝ ∧ 2 ∈ ℝ) → if(𝑀 ≤ 2, 𝑀, 2) ≤ 2)
12	9, 10, 11	sylancl 587	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → if(𝑀 ≤ 2, 𝑀, 2) ≤ 2)
13		eluz2 12828	. . . . . . . . 9 ⊢ (2 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2)) ↔ (if(𝑀 ≤ 2, 𝑀, 2) ∈ ℤ ∧ 2 ∈ ℤ ∧ if(𝑀 ≤ 2, 𝑀, 2) ≤ 2))
14	7, 8, 12, 13	syl3anbrc 1344	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 2 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2)))
15		ppisval2 26609	. . . . . . . 8 ⊢ ((𝑁 ∈ ℝ ∧ 2 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2))) → ((0[,]𝑁) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑁)) ∩ ℙ))
16	1, 14, 15	syl2anc 585	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((0[,]𝑁) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑁)) ∩ ℙ))
17		eluzelz 12832	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ ℤ)
18		flid 13773	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → (⌊‘𝑁) = 𝑁)
19	17, 18	syl 17	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (⌊‘𝑁) = 𝑁)
20	19	oveq2d 7425	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑁)) = (if(𝑀 ≤ 2, 𝑀, 2)...𝑁))
21	20	ineq1d 4212	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑁)) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
22	16, 21	eqtrd 2773	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((0[,]𝑁) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
23	22	sumeq1d 15647	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → Σ𝑝 ∈ ((0[,]𝑁) ∩ ℙ)(log‘𝑝) = Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)(log‘𝑝))
24	9	ltp1d 12144	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 < (𝑀 + 1))
25		fzdisj 13528	. . . . . . . . 9 ⊢ (𝑀 < (𝑀 + 1) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅)
26	24, 25	syl 17	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅)
27	26	ineq1d 4212	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ((𝑀 + 1)...𝑁)) ∩ ℙ) = (∅ ∩ ℙ))
28		inindir 4228	. . . . . . 7 ⊢ (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ((𝑀 + 1)...𝑁)) ∩ ℙ) = (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∩ (((𝑀 + 1)...𝑁) ∩ ℙ))
29		0in 4394	. . . . . . 7 ⊢ (∅ ∩ ℙ) = ∅
30	27, 28, 29	3eqtr3g 2796	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∩ (((𝑀 + 1)...𝑁) ∩ ℙ)) = ∅)
31		min1 13168	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℝ ∧ 2 ∈ ℝ) → if(𝑀 ≤ 2, 𝑀, 2) ≤ 𝑀)
32	9, 10, 31	sylancl 587	. . . . . . . . . . 11 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → if(𝑀 ≤ 2, 𝑀, 2) ≤ 𝑀)
33		eluz2 12828	. . . . . . . . . . 11 ⊢ (𝑀 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2)) ↔ (if(𝑀 ≤ 2, 𝑀, 2) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ if(𝑀 ≤ 2, 𝑀, 2) ≤ 𝑀))
34	7, 4, 32, 33	syl3anbrc 1344	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2)))
35		id 22	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ (ℤ_≥‘𝑀))
36		elfzuzb 13495	. . . . . . . . . 10 ⊢ (𝑀 ∈ (if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ↔ (𝑀 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2)) ∧ 𝑁 ∈ (ℤ_≥‘𝑀)))
37	34, 35, 36	sylanbrc 584	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ (if(𝑀 ≤ 2, 𝑀, 2)...𝑁))
38		fzsplit 13527	. . . . . . . . 9 ⊢ (𝑀 ∈ (if(𝑀 ≤ 2, 𝑀, 2)...𝑁) → (if(𝑀 ≤ 2, 𝑀, 2)...𝑁) = ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∪ ((𝑀 + 1)...𝑁)))
39	37, 38	syl 17	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (if(𝑀 ≤ 2, 𝑀, 2)...𝑁) = ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∪ ((𝑀 + 1)...𝑁)))
40	39	ineq1d 4212	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ) = (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∪ ((𝑀 + 1)...𝑁)) ∩ ℙ))
41		indir 4276	. . . . . . 7 ⊢ (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∪ ((𝑀 + 1)...𝑁)) ∩ ℙ) = (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∪ (((𝑀 + 1)...𝑁) ∩ ℙ))
42	40, 41	eqtrdi 2789	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ) = (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∪ (((𝑀 + 1)...𝑁) ∩ ℙ)))
43		fzfid 13938	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∈ Fin)
44		inss1 4229	. . . . . . 7 ⊢ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ) ⊆ (if(𝑀 ≤ 2, 𝑀, 2)...𝑁)
45		ssfi 9173	. . . . . . 7 ⊢ (((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∈ Fin ∧ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ) ⊆ (if(𝑀 ≤ 2, 𝑀, 2)...𝑁)) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ) ∈ Fin)
46	43, 44, 45	sylancl 587	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ) ∈ Fin)
47		simpr 486	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)) → 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
48	47	elin2d 4200	. . . . . . . . . 10 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)) → 𝑝 ∈ ℙ)
49		prmnn 16611	. . . . . . . . . 10 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℕ)
50	48, 49	syl 17	. . . . . . . . 9 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)) → 𝑝 ∈ ℕ)
51	50	nnrpd 13014	. . . . . . . 8 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)) → 𝑝 ∈ ℝ⁺)
52	51	relogcld 26131	. . . . . . 7 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)) → (log‘𝑝) ∈ ℝ)
53	52	recnd 11242	. . . . . 6 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)) → (log‘𝑝) ∈ ℂ)
54	30, 42, 46, 53	fsumsplit 15687	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)(log‘𝑝) = (Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝) + Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝)))
55	23, 54	eqtrd 2773	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → Σ𝑝 ∈ ((0[,]𝑁) ∩ ℙ)(log‘𝑝) = (Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝) + Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝)))
56	3, 55	eqtrd 2773	. . 3 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (θ‘𝑁) = (Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝) + Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝)))
57		chtval 26614	. . . . 5 ⊢ (𝑀 ∈ ℝ → (θ‘𝑀) = Σ𝑝 ∈ ((0[,]𝑀) ∩ ℙ)(log‘𝑝))
58	9, 57	syl 17	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (θ‘𝑀) = Σ𝑝 ∈ ((0[,]𝑀) ∩ ℙ)(log‘𝑝))
59		ppisval2 26609	. . . . . . 7 ⊢ ((𝑀 ∈ ℝ ∧ 2 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2))) → ((0[,]𝑀) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑀)) ∩ ℙ))
60	9, 14, 59	syl2anc 585	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((0[,]𝑀) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑀)) ∩ ℙ))
61		flid 13773	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → (⌊‘𝑀) = 𝑀)
62	4, 61	syl 17	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (⌊‘𝑀) = 𝑀)
63	62	oveq2d 7425	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑀)) = (if(𝑀 ≤ 2, 𝑀, 2)...𝑀))
64	63	ineq1d 4212	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑀)) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ))
65	60, 64	eqtrd 2773	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((0[,]𝑀) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ))
66	65	sumeq1d 15647	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → Σ𝑝 ∈ ((0[,]𝑀) ∩ ℙ)(log‘𝑝) = Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝))
67	58, 66	eqtrd 2773	. . 3 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (θ‘𝑀) = Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝))
68	56, 67	oveq12d 7427	. 2 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((θ‘𝑁) − (θ‘𝑀)) = ((Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝) + Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝)) − Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝)))
69		fzfi 13937	. . . . . 6 ⊢ (if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∈ Fin
70		inss1 4229	. . . . . 6 ⊢ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ⊆ (if(𝑀 ≤ 2, 𝑀, 2)...𝑀)
71		ssfi 9173	. . . . . 6 ⊢ (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∈ Fin ∧ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ⊆ (if(𝑀 ≤ 2, 𝑀, 2)...𝑀)) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∈ Fin)
72	69, 70, 71	mp2an 691	. . . . 5 ⊢ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∈ Fin
73	72	a1i 11	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∈ Fin)
74		ssun1 4173	. . . . . . 7 ⊢ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ⊆ (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∪ (((𝑀 + 1)...𝑁) ∩ ℙ))
75	74, 42	sseqtrrid 4036	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ⊆ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
76	75	sselda 3983	. . . . 5 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)) → 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
77	76, 53	syldan 592	. . . 4 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)) → (log‘𝑝) ∈ ℂ)
78	73, 77	fsumcl 15679	. . 3 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝) ∈ ℂ)
79		fzfi 13937	. . . . . 6 ⊢ ((𝑀 + 1)...𝑁) ∈ Fin
80		inss1 4229	. . . . . 6 ⊢ (((𝑀 + 1)...𝑁) ∩ ℙ) ⊆ ((𝑀 + 1)...𝑁)
81		ssfi 9173	. . . . . 6 ⊢ ((((𝑀 + 1)...𝑁) ∈ Fin ∧ (((𝑀 + 1)...𝑁) ∩ ℙ) ⊆ ((𝑀 + 1)...𝑁)) → (((𝑀 + 1)...𝑁) ∩ ℙ) ∈ Fin)
82	79, 80, 81	mp2an 691	. . . . 5 ⊢ (((𝑀 + 1)...𝑁) ∩ ℙ) ∈ Fin
83	82	a1i 11	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (((𝑀 + 1)...𝑁) ∩ ℙ) ∈ Fin)
84		ssun2 4174	. . . . . . 7 ⊢ (((𝑀 + 1)...𝑁) ∩ ℙ) ⊆ (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∪ (((𝑀 + 1)...𝑁) ∩ ℙ))
85	84, 42	sseqtrrid 4036	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (((𝑀 + 1)...𝑁) ∩ ℙ) ⊆ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
86	85	sselda 3983	. . . . 5 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)) → 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
87	86, 53	syldan 592	. . . 4 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)) → (log‘𝑝) ∈ ℂ)
88	83, 87	fsumcl 15679	. . 3 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝) ∈ ℂ)
89	78, 88	pncan2d 11573	. 2 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝) + Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝)) − Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝)) = Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝))
90	68, 89	eqtrd 2773	1 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((θ‘𝑁) − (θ‘𝑀)) = Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∪ cun 3947 ∩ cin 3948 ⊆ wss 3949 ∅c0 4323 ifcif 4529 class class class wbr 5149 ‘cfv 6544 (class class class)co 7409 Fincfn 8939 ℂcc 11108 ℝcr 11109 0cc0 11110 1c1 11111 + caddc 11113 < clt 11248 ≤ cle 11249 − cmin 11444 ℕcn 12212 2c2 12267 ℤcz 12558 ℤ_≥cuz 12822 [,]cicc 13327 ...cfz 13484 ⌊cfl 13755 Σcsu 15632 ℙcprime 16608 logclog 26063 θccht 26595

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-inf2 9636 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 ax-pre-sup 11188 ax-addf 11189 ax-mulf 11190

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-iin 5001 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-se 5633 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-isom 6553 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-of 7670 df-om 7856 df-1st 7975 df-2nd 7976 df-supp 8147 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-2o 8467 df-er 8703 df-map 8822 df-pm 8823 df-ixp 8892 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-fsupp 9362 df-fi 9406 df-sup 9437 df-inf 9438 df-oi 9505 df-card 9934 df-pnf 11250 df-mnf 11251 df-xr 11252 df-ltxr 11253 df-le 11254 df-sub 11446 df-neg 11447 df-div 11872 df-nn 12213 df-2 12275 df-3 12276 df-4 12277 df-5 12278 df-6 12279 df-7 12280 df-8 12281 df-9 12282 df-n0 12473 df-z 12559 df-dec 12678 df-uz 12823 df-q 12933 df-rp 12975 df-xneg 13092 df-xadd 13093 df-xmul 13094 df-ioo 13328 df-ioc 13329 df-ico 13330 df-icc 13331 df-fz 13485 df-fzo 13628 df-fl 13757 df-mod 13835 df-seq 13967 df-exp 14028 df-fac 14234 df-bc 14263 df-hash 14291 df-shft 15014 df-cj 15046 df-re 15047 df-im 15048 df-sqrt 15182 df-abs 15183 df-limsup 15415 df-clim 15432 df-rlim 15433 df-sum 15633 df-ef 16011 df-sin 16013 df-cos 16014 df-pi 16016 df-dvds 16198 df-prm 16609 df-struct 17080 df-sets 17097 df-slot 17115 df-ndx 17127 df-base 17145 df-ress 17174 df-plusg 17210 df-mulr 17211 df-starv 17212 df-sca 17213 df-vsca 17214 df-ip 17215 df-tset 17216 df-ple 17217 df-ds 17219 df-unif 17220 df-hom 17221 df-cco 17222 df-rest 17368 df-topn 17369 df-0g 17387 df-gsum 17388 df-topgen 17389 df-pt 17390 df-prds 17393 df-xrs 17448 df-qtop 17453 df-imas 17454 df-xps 17456 df-mre 17530 df-mrc 17531 df-acs 17533 df-mgm 18561 df-sgrp 18610 df-mnd 18626 df-submnd 18672 df-mulg 18951 df-cntz 19181 df-cmn 19650 df-psmet 20936 df-xmet 20937 df-met 20938 df-bl 20939 df-mopn 20940 df-fbas 20941 df-fg 20942 df-cnfld 20945 df-top 22396 df-topon 22413 df-topsp 22435 df-bases 22449 df-cld 22523 df-ntr 22524 df-cls 22525 df-nei 22602 df-lp 22640 df-perf 22641 df-cn 22731 df-cnp 22732 df-haus 22819 df-tx 23066 df-hmeo 23259 df-fil 23350 df-fm 23442 df-flim 23443 df-flf 23444 df-xms 23826 df-ms 23827 df-tms 23828 df-cncf 24394 df-limc 25383 df-dv 25384 df-log 26065 df-cht 26601

This theorem is referenced by: efchtdvds 26663

W3C validator