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 26651

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 12829	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ ℝ)
2		chtval 26603	. . . . 5 ⊢ (𝑁 ∈ ℝ → (θ‘𝑁) = Σ𝑝 ∈ ((0[,]𝑁) ∩ ℙ)(log‘𝑝))
3	1, 2	syl 17	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (θ‘𝑁) = Σ𝑝 ∈ ((0[,]𝑁) ∩ ℙ)(log‘𝑝))
4		eluzel2 12823	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℤ)
5		2z 12590	. . . . . . . . . 10 ⊢ 2 ∈ ℤ
6		ifcl 4572	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℤ ∧ 2 ∈ ℤ) → if(𝑀 ≤ 2, 𝑀, 2) ∈ ℤ)
7	4, 5, 6	sylancl 586	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → if(𝑀 ≤ 2, 𝑀, 2) ∈ ℤ)
8	5	a1i 11	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 2 ∈ ℤ)
9	4	zred 12662	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℝ)
10		2re 12282	. . . . . . . . . 10 ⊢ 2 ∈ ℝ
11		min2 13165	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℝ ∧ 2 ∈ ℝ) → if(𝑀 ≤ 2, 𝑀, 2) ≤ 2)
12	9, 10, 11	sylancl 586	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → if(𝑀 ≤ 2, 𝑀, 2) ≤ 2)
13		eluz2 12824	. . . . . . . . 9 ⊢ (2 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2)) ↔ (if(𝑀 ≤ 2, 𝑀, 2) ∈ ℤ ∧ 2 ∈ ℤ ∧ if(𝑀 ≤ 2, 𝑀, 2) ≤ 2))
14	7, 8, 12, 13	syl3anbrc 1343	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 2 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2)))
15		ppisval2 26598	. . . . . . . 8 ⊢ ((𝑁 ∈ ℝ ∧ 2 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2))) → ((0[,]𝑁) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑁)) ∩ ℙ))
16	1, 14, 15	syl2anc 584	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((0[,]𝑁) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑁)) ∩ ℙ))
17		eluzelz 12828	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ ℤ)
18		flid 13769	. . . . . . . . . 10 ⊢ (𝑁 ∈ ℤ → (⌊‘𝑁) = 𝑁)
19	17, 18	syl 17	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (⌊‘𝑁) = 𝑁)
20	19	oveq2d 7421	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑁)) = (if(𝑀 ≤ 2, 𝑀, 2)...𝑁))
21	20	ineq1d 4210	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑁)) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
22	16, 21	eqtrd 2772	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((0[,]𝑁) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
23	22	sumeq1d 15643	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → Σ𝑝 ∈ ((0[,]𝑁) ∩ ℙ)(log‘𝑝) = Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)(log‘𝑝))
24	9	ltp1d 12140	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 < (𝑀 + 1))
25		fzdisj 13524	. . . . . . . . 9 ⊢ (𝑀 < (𝑀 + 1) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅)
26	24, 25	syl 17	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅)
27	26	ineq1d 4210	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ((𝑀 + 1)...𝑁)) ∩ ℙ) = (∅ ∩ ℙ))
28		inindir 4226	. . . . . . 7 ⊢ (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ((𝑀 + 1)...𝑁)) ∩ ℙ) = (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∩ (((𝑀 + 1)...𝑁) ∩ ℙ))
29		0in 4392	. . . . . . 7 ⊢ (∅ ∩ ℙ) = ∅
30	27, 28, 29	3eqtr3g 2795	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∩ (((𝑀 + 1)...𝑁) ∩ ℙ)) = ∅)
31		min1 13164	. . . . . . . . . . . 12 ⊢ ((𝑀 ∈ ℝ ∧ 2 ∈ ℝ) → if(𝑀 ≤ 2, 𝑀, 2) ≤ 𝑀)
32	9, 10, 31	sylancl 586	. . . . . . . . . . 11 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → if(𝑀 ≤ 2, 𝑀, 2) ≤ 𝑀)
33		eluz2 12824	. . . . . . . . . . 11 ⊢ (𝑀 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2)) ↔ (if(𝑀 ≤ 2, 𝑀, 2) ∈ ℤ ∧ 𝑀 ∈ ℤ ∧ if(𝑀 ≤ 2, 𝑀, 2) ≤ 𝑀))
34	7, 4, 32, 33	syl3anbrc 1343	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2)))
35		id 22	. . . . . . . . . 10 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑁 ∈ (ℤ_≥‘𝑀))
36		elfzuzb 13491	. . . . . . . . . 10 ⊢ (𝑀 ∈ (if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ↔ (𝑀 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2)) ∧ 𝑁 ∈ (ℤ_≥‘𝑀)))
37	34, 35, 36	sylanbrc 583	. . . . . . . . 9 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ (if(𝑀 ≤ 2, 𝑀, 2)...𝑁))
38		fzsplit 13523	. . . . . . . . 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 4210	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ) = (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∪ ((𝑀 + 1)...𝑁)) ∩ ℙ))
41		indir 4274	. . . . . . 7 ⊢ (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∪ ((𝑀 + 1)...𝑁)) ∩ ℙ) = (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∪ (((𝑀 + 1)...𝑁) ∩ ℙ))
42	40, 41	eqtrdi 2788	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ) = (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∪ (((𝑀 + 1)...𝑁) ∩ ℙ)))
43		fzfid 13934	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∈ Fin)
44		inss1 4227	. . . . . . 7 ⊢ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ) ⊆ (if(𝑀 ≤ 2, 𝑀, 2)...𝑁)
45		ssfi 9169	. . . . . . 7 ⊢ (((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∈ Fin ∧ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ) ⊆ (if(𝑀 ≤ 2, 𝑀, 2)...𝑁)) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ) ∈ Fin)
46	43, 44, 45	sylancl 586	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ) ∈ Fin)
47		simpr 485	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)) → 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
48	47	elin2d 4198	. . . . . . . . . 10 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)) → 𝑝 ∈ ℙ)
49		prmnn 16607	. . . . . . . . . 10 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℕ)
50	48, 49	syl 17	. . . . . . . . 9 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)) → 𝑝 ∈ ℕ)
51	50	nnrpd 13010	. . . . . . . 8 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)) → 𝑝 ∈ ℝ⁺)
52	51	relogcld 26122	. . . . . . 7 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)) → (log‘𝑝) ∈ ℝ)
53	52	recnd 11238	. . . . . 6 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)) → (log‘𝑝) ∈ ℂ)
54	30, 42, 46, 53	fsumsplit 15683	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ)(log‘𝑝) = (Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝) + Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝)))
55	23, 54	eqtrd 2772	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → Σ𝑝 ∈ ((0[,]𝑁) ∩ ℙ)(log‘𝑝) = (Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝) + Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝)))
56	3, 55	eqtrd 2772	. . 3 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (θ‘𝑁) = (Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝) + Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝)))
57		chtval 26603	. . . . 5 ⊢ (𝑀 ∈ ℝ → (θ‘𝑀) = Σ𝑝 ∈ ((0[,]𝑀) ∩ ℙ)(log‘𝑝))
58	9, 57	syl 17	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (θ‘𝑀) = Σ𝑝 ∈ ((0[,]𝑀) ∩ ℙ)(log‘𝑝))
59		ppisval2 26598	. . . . . . 7 ⊢ ((𝑀 ∈ ℝ ∧ 2 ∈ (ℤ_≥‘if(𝑀 ≤ 2, 𝑀, 2))) → ((0[,]𝑀) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑀)) ∩ ℙ))
60	9, 14, 59	syl2anc 584	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((0[,]𝑀) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑀)) ∩ ℙ))
61		flid 13769	. . . . . . . . 9 ⊢ (𝑀 ∈ ℤ → (⌊‘𝑀) = 𝑀)
62	4, 61	syl 17	. . . . . . . 8 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (⌊‘𝑀) = 𝑀)
63	62	oveq2d 7421	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑀)) = (if(𝑀 ≤ 2, 𝑀, 2)...𝑀))
64	63	ineq1d 4210	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...(⌊‘𝑀)) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ))
65	60, 64	eqtrd 2772	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((0[,]𝑀) ∩ ℙ) = ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ))
66	65	sumeq1d 15643	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → Σ𝑝 ∈ ((0[,]𝑀) ∩ ℙ)(log‘𝑝) = Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝))
67	58, 66	eqtrd 2772	. . 3 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (θ‘𝑀) = Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝))
68	56, 67	oveq12d 7423	. 2 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((θ‘𝑁) − (θ‘𝑀)) = ((Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝) + Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝)) − Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝)))
69		fzfi 13933	. . . . . 6 ⊢ (if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∈ Fin
70		inss1 4227	. . . . . 6 ⊢ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ⊆ (if(𝑀 ≤ 2, 𝑀, 2)...𝑀)
71		ssfi 9169	. . . . . 6 ⊢ (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∈ Fin ∧ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ⊆ (if(𝑀 ≤ 2, 𝑀, 2)...𝑀)) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∈ Fin)
72	69, 70, 71	mp2an 690	. . . . 5 ⊢ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∈ Fin
73	72	a1i 11	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∈ Fin)
74		ssun1 4171	. . . . . . 7 ⊢ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ⊆ (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∪ (((𝑀 + 1)...𝑁) ∩ ℙ))
75	74, 42	sseqtrrid 4034	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ⊆ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
76	75	sselda 3981	. . . . 5 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)) → 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
77	76, 53	syldan 591	. . . 4 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)) → (log‘𝑝) ∈ ℂ)
78	73, 77	fsumcl 15675	. . 3 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝) ∈ ℂ)
79		fzfi 13933	. . . . . 6 ⊢ ((𝑀 + 1)...𝑁) ∈ Fin
80		inss1 4227	. . . . . 6 ⊢ (((𝑀 + 1)...𝑁) ∩ ℙ) ⊆ ((𝑀 + 1)...𝑁)
81		ssfi 9169	. . . . . 6 ⊢ ((((𝑀 + 1)...𝑁) ∈ Fin ∧ (((𝑀 + 1)...𝑁) ∩ ℙ) ⊆ ((𝑀 + 1)...𝑁)) → (((𝑀 + 1)...𝑁) ∩ ℙ) ∈ Fin)
82	79, 80, 81	mp2an 690	. . . . 5 ⊢ (((𝑀 + 1)...𝑁) ∩ ℙ) ∈ Fin
83	82	a1i 11	. . . 4 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (((𝑀 + 1)...𝑁) ∩ ℙ) ∈ Fin)
84		ssun2 4172	. . . . . . 7 ⊢ (((𝑀 + 1)...𝑁) ∩ ℙ) ⊆ (((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ) ∪ (((𝑀 + 1)...𝑁) ∩ ℙ))
85	84, 42	sseqtrrid 4034	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (((𝑀 + 1)...𝑁) ∩ ℙ) ⊆ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
86	85	sselda 3981	. . . . 5 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)) → 𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑁) ∩ ℙ))
87	86, 53	syldan 591	. . . 4 ⊢ ((𝑁 ∈ (ℤ_≥‘𝑀) ∧ 𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)) → (log‘𝑝) ∈ ℂ)
88	83, 87	fsumcl 15675	. . 3 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝) ∈ ℂ)
89	78, 88	pncan2d 11569	. 2 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝) + Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝)) − Σ𝑝 ∈ ((if(𝑀 ≤ 2, 𝑀, 2)...𝑀) ∩ ℙ)(log‘𝑝)) = Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝))
90	68, 89	eqtrd 2772	1 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → ((θ‘𝑁) − (θ‘𝑀)) = Σ𝑝 ∈ (((𝑀 + 1)...𝑁) ∩ ℙ)(log‘𝑝))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∪ cun 3945 ∩ cin 3946 ⊆ wss 3947 ∅c0 4321 ifcif 4527 class class class wbr 5147 ‘cfv 6540 (class class class)co 7405 Fincfn 8935 ℂcc 11104 ℝcr 11105 0cc0 11106 1c1 11107 + caddc 11109 < clt 11244 ≤ cle 11245 − cmin 11440 ℕcn 12208 2c2 12263 ℤcz 12554 ℤ_≥cuz 12818 [,]cicc 13323 ...cfz 13480 ⌊cfl 13751 Σcsu 15628 ℙcprime 16604 logclog 26054 θccht 26584

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-inf2 9632 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184 ax-addf 11185 ax-mulf 11186

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-tp 4632 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-of 7666 df-om 7852 df-1st 7971 df-2nd 7972 df-supp 8143 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-2o 8463 df-er 8699 df-map 8818 df-pm 8819 df-ixp 8888 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-fsupp 9358 df-fi 9402 df-sup 9433 df-inf 9434 df-oi 9501 df-card 9930 df-pnf 11246 df-mnf 11247 df-xr 11248 df-ltxr 11249 df-le 11250 df-sub 11442 df-neg 11443 df-div 11868 df-nn 12209 df-2 12271 df-3 12272 df-4 12273 df-5 12274 df-6 12275 df-7 12276 df-8 12277 df-9 12278 df-n0 12469 df-z 12555 df-dec 12674 df-uz 12819 df-q 12929 df-rp 12971 df-xneg 13088 df-xadd 13089 df-xmul 13090 df-ioo 13324 df-ioc 13325 df-ico 13326 df-icc 13327 df-fz 13481 df-fzo 13624 df-fl 13753 df-mod 13831 df-seq 13963 df-exp 14024 df-fac 14230 df-bc 14259 df-hash 14287 df-shft 15010 df-cj 15042 df-re 15043 df-im 15044 df-sqrt 15178 df-abs 15179 df-limsup 15411 df-clim 15428 df-rlim 15429 df-sum 15629 df-ef 16007 df-sin 16009 df-cos 16010 df-pi 16012 df-dvds 16194 df-prm 16605 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17141 df-ress 17170 df-plusg 17206 df-mulr 17207 df-starv 17208 df-sca 17209 df-vsca 17210 df-ip 17211 df-tset 17212 df-ple 17213 df-ds 17215 df-unif 17216 df-hom 17217 df-cco 17218 df-rest 17364 df-topn 17365 df-0g 17383 df-gsum 17384 df-topgen 17385 df-pt 17386 df-prds 17389 df-xrs 17444 df-qtop 17449 df-imas 17450 df-xps 17452 df-mre 17526 df-mrc 17527 df-acs 17529 df-mgm 18557 df-sgrp 18606 df-mnd 18622 df-submnd 18668 df-mulg 18945 df-cntz 19175 df-cmn 19644 df-psmet 20928 df-xmet 20929 df-met 20930 df-bl 20931 df-mopn 20932 df-fbas 20933 df-fg 20934 df-cnfld 20937 df-top 22387 df-topon 22404 df-topsp 22426 df-bases 22440 df-cld 22514 df-ntr 22515 df-cls 22516 df-nei 22593 df-lp 22631 df-perf 22632 df-cn 22722 df-cnp 22723 df-haus 22810 df-tx 23057 df-hmeo 23250 df-fil 23341 df-fm 23433 df-flim 23434 df-flf 23435 df-xms 23817 df-ms 23818 df-tms 23819 df-cncf 24385 df-limc 25374 df-dv 25375 df-log 26056 df-cht 26590

This theorem is referenced by: efchtdvds 26652

W3C validator