cvgcmp2nlemabs - Mathbox for Jim Kingdon

	Mathbox for Jim Kingdon		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > Mathboxes > cvgcmp2nlemabs		GIF version

Theorem cvgcmp2nlemabs 17299

Description: Lemma for cvgcmp2n 17300. The partial sums get closer to each other as we go further out. The proof proceeds by rewriting (seq1( + , 𝐺)‘𝑁) as the sum of (seq1( + , 𝐺)‘𝑀) and a term which gets smaller as 𝑀 gets large. (Contributed by Jim Kingdon, 25-Aug-2023.)

**Hypotheses**
Ref	Expression
cvgcmp2n.cl	⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐺‘𝑘) ∈ ℝ)
cvgcmp2n.ge0	⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 0 ≤ (𝐺‘𝑘))
cvgcmp2n.lt	⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐺‘𝑘) ≤ (1 / (2↑𝑘)))
cvgcmp2nlemabs.m	⊢ (𝜑 → 𝑀 ∈ ℕ)
cvgcmp2nlemabs.n	⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))

**Assertion**
Ref	Expression
cvgcmp2nlemabs	⊢ (𝜑 → (abs‘((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀))) < (2 / 𝑀))

Distinct variable groups: 𝑘,𝐺 𝑘,𝑀 𝑘,𝑁 𝜑,𝑘

**Proof of Theorem cvgcmp2nlemabs**
Step	Hyp	Ref	Expression
1		eqidd 2239	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘1)) → (𝐺‘𝑘) = (𝐺‘𝑘))
2		cvgcmp2nlemabs.m	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℕ)
3		cvgcmp2nlemabs.n	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
4		eluznn 10017	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) → 𝑁 ∈ ℕ)
5	2, 3, 4	syl2anc 415	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℕ)
6		elnnuz 9976	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ ↔ 𝑁 ∈ (ℤ_≥‘1))
7	5, 6	sylib 122	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘1))
8		elnnuz 9976	. . . . . . . . 9 ⊢ (𝑘 ∈ ℕ ↔ 𝑘 ∈ (ℤ_≥‘1))
9		cvgcmp2n.cl	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐺‘𝑘) ∈ ℝ)
10	9	recnd 8361	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐺‘𝑘) ∈ ℂ)
11	8, 10	sylan2br 288	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘1)) → (𝐺‘𝑘) ∈ ℂ)
12	1, 7, 11	fsum3ser 12190	. . . . . . 7 ⊢ (𝜑 → Σ𝑘 ∈ (1...𝑁)(𝐺‘𝑘) = (seq1( + , 𝐺)‘𝑁))
13		nnuz 9975	. . . . . . . . 9 ⊢ ℕ = (ℤ_≥‘1)
14	2, 13	eleqtrdi 2331	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘1))
15	1, 14, 11	fsum3ser 12190	. . . . . . 7 ⊢ (𝜑 → Σ𝑘 ∈ (1...𝑀)(𝐺‘𝑘) = (seq1( + , 𝐺)‘𝑀))
16	12, 15	oveq12d 6106	. . . . . 6 ⊢ (𝜑 → (Σ𝑘 ∈ (1...𝑁)(𝐺‘𝑘) − Σ𝑘 ∈ (1...𝑀)(𝐺‘𝑘)) = ((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀)))
17	2	nnred 9327	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ ℝ)
18	17	ltp1d 9269	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 < (𝑀 + 1))
19		fzdisj 10475	. . . . . . . . . 10 ⊢ (𝑀 < (𝑀 + 1) → ((1...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅)
20	18, 19	syl 14	. . . . . . . . 9 ⊢ (𝜑 → ((1...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅)
21		eluzle 9951	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ≤ 𝑁)
22	3, 21	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ≤ 𝑁)
23		elfz1b 10515	. . . . . . . . . . 11 ⊢ (𝑀 ∈ (1...𝑁) ↔ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁))
24	2, 5, 22, 23	syl3anbrc 1212	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ (1...𝑁))
25		fzsplit 10474	. . . . . . . . . 10 ⊢ (𝑀 ∈ (1...𝑁) → (1...𝑁) = ((1...𝑀) ∪ ((𝑀 + 1)...𝑁)))
26	24, 25	syl 14	. . . . . . . . 9 ⊢ (𝜑 → (1...𝑁) = ((1...𝑀) ∪ ((𝑀 + 1)...𝑁)))
27		1zzd 9683	. . . . . . . . . 10 ⊢ (𝜑 → 1 ∈ ℤ)
28	5	nnzd 9779	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℤ)
29	27, 28	fzfigd 10890	. . . . . . . . 9 ⊢ (𝜑 → (1...𝑁) ∈ Fin)
30		elfznn 10478	. . . . . . . . . 10 ⊢ (𝑘 ∈ (1...𝑁) → 𝑘 ∈ ℕ)
31	30, 10	sylan2 286	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝑁)) → (𝐺‘𝑘) ∈ ℂ)
32	20, 26, 29, 31	fsumsplit 12200	. . . . . . . 8 ⊢ (𝜑 → Σ𝑘 ∈ (1...𝑁)(𝐺‘𝑘) = (Σ𝑘 ∈ (1...𝑀)(𝐺‘𝑘) + Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘)))
33	32	eqcomd 2244	. . . . . . 7 ⊢ (𝜑 → (Σ𝑘 ∈ (1...𝑀)(𝐺‘𝑘) + Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘)) = Σ𝑘 ∈ (1...𝑁)(𝐺‘𝑘))
34	29, 31	fsumcl 12193	. . . . . . . 8 ⊢ (𝜑 → Σ𝑘 ∈ (1...𝑁)(𝐺‘𝑘) ∈ ℂ)
35	2	nnzd 9779	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℤ)
36	27, 35	fzfigd 10890	. . . . . . . . 9 ⊢ (𝜑 → (1...𝑀) ∈ Fin)
37		elfznn 10478	. . . . . . . . . 10 ⊢ (𝑘 ∈ (1...𝑀) → 𝑘 ∈ ℕ)
38	37, 10	sylan2 286	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝑀)) → (𝐺‘𝑘) ∈ ℂ)
39	36, 38	fsumcl 12193	. . . . . . . 8 ⊢ (𝜑 → Σ𝑘 ∈ (1...𝑀)(𝐺‘𝑘) ∈ ℂ)
40	35	peano2zd 9783	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀 + 1) ∈ ℤ)
41	40, 28	fzfigd 10890	. . . . . . . . 9 ⊢ (𝜑 → ((𝑀 + 1)...𝑁) ∈ Fin)
42	2	peano2nnd 9329	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑀 + 1) ∈ ℕ)
43		elfzuz 10442	. . . . . . . . . . 11 ⊢ (𝑘 ∈ ((𝑀 + 1)...𝑁) → 𝑘 ∈ (ℤ_≥‘(𝑀 + 1)))
44		eluznn 10017	. . . . . . . . . . 11 ⊢ (((𝑀 + 1) ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘(𝑀 + 1))) → 𝑘 ∈ ℕ)
45	42, 43, 44	syl2an 289	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → 𝑘 ∈ ℕ)
46	45, 10	syldan 282	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → (𝐺‘𝑘) ∈ ℂ)
47	41, 46	fsumcl 12193	. . . . . . . 8 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) ∈ ℂ)
48	34, 39, 47	subaddd 8663	. . . . . . 7 ⊢ (𝜑 → ((Σ𝑘 ∈ (1...𝑁)(𝐺‘𝑘) − Σ𝑘 ∈ (1...𝑀)(𝐺‘𝑘)) = Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) ↔ (Σ𝑘 ∈ (1...𝑀)(𝐺‘𝑘) + Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘)) = Σ𝑘 ∈ (1...𝑁)(𝐺‘𝑘)))
49	33, 48	mpbird 167	. . . . . 6 ⊢ (𝜑 → (Σ𝑘 ∈ (1...𝑁)(𝐺‘𝑘) − Σ𝑘 ∈ (1...𝑀)(𝐺‘𝑘)) = Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘))
50	16, 49	eqtr3d 2273	. . . . 5 ⊢ (𝜑 → ((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀)) = Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘))
51	45, 9	syldan 282	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → (𝐺‘𝑘) ∈ ℝ)
52	41, 51	fsumrecl 12194	. . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) ∈ ℝ)
53	50, 52	eqeltrd 2315	. . . 4 ⊢ (𝜑 → ((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀)) ∈ ℝ)
54	42	nnzd 9779	. . . . . . 7 ⊢ (𝜑 → (𝑀 + 1) ∈ ℤ)
55	54, 28	fzfigd 10890	. . . . . 6 ⊢ (𝜑 → ((𝑀 + 1)...𝑁) ∈ Fin)
56		cvgcmp2n.ge0	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 0 ≤ (𝐺‘𝑘))
57	45, 56	syldan 282	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → 0 ≤ (𝐺‘𝑘))
58	55, 51, 57	fsumge0 12252	. . . . 5 ⊢ (𝜑 → 0 ≤ Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘))
59	58, 50	breqtrrd 4159	. . . 4 ⊢ (𝜑 → 0 ≤ ((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀)))
60	53, 59	absidd 11957	. . 3 ⊢ (𝜑 → (abs‘((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀))) = ((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀)))
61	60, 50	eqtrd 2271	. 2 ⊢ (𝜑 → (abs‘((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀))) = Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘))
62		halfre 9530	. . . . . . 7 ⊢ (1 / 2) ∈ ℝ
63	62	a1i 9	. . . . . 6 ⊢ (𝜑 → (1 / 2) ∈ ℝ)
64	42	nnnn0d 9632	. . . . . 6 ⊢ (𝜑 → (𝑀 + 1) ∈ ℕ₀)
65	63, 64	reexpcld 11150	. . . . 5 ⊢ (𝜑 → ((1 / 2)↑(𝑀 + 1)) ∈ ℝ)
66	5	peano2nnd 9329	. . . . . . 7 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ)
67	66	nnnn0d 9632	. . . . . 6 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ₀)
68	63, 67	reexpcld 11150	. . . . 5 ⊢ (𝜑 → ((1 / 2)↑(𝑁 + 1)) ∈ ℝ)
69	65, 68	resubcld 8716	. . . 4 ⊢ (𝜑 → (((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) ∈ ℝ)
70		1mhlfehlf 9535	. . . . . 6 ⊢ (1 − (1 / 2)) = (1 / 2)
71		2rp 10077	. . . . . . 7 ⊢ 2 ∈ ℝ⁺
72		rpreccl 10099	. . . . . . 7 ⊢ (2 ∈ ℝ⁺ → (1 / 2) ∈ ℝ⁺)
73	71, 72	ax-mp 5	. . . . . 6 ⊢ (1 / 2) ∈ ℝ⁺
74	70, 73	eqeltri 2311	. . . . 5 ⊢ (1 − (1 / 2)) ∈ ℝ⁺
75	74	a1i 9	. . . 4 ⊢ (𝜑 → (1 − (1 / 2)) ∈ ℝ⁺)
76	69, 75	rerpdivcld 10147	. . 3 ⊢ (𝜑 → ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 − (1 / 2))) ∈ ℝ)
77	71	a1i 9	. . . . 5 ⊢ (𝜑 → 2 ∈ ℝ⁺)
78	2	nnrpd 10113	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℝ⁺)
79	77, 78	rpdivcld 10133	. . . 4 ⊢ (𝜑 → (2 / 𝑀) ∈ ℝ⁺)
80	79	rpred 10115	. . 3 ⊢ (𝜑 → (2 / 𝑀) ∈ ℝ)
81	71	a1i 9	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → 2 ∈ ℝ⁺)
82	45	nnzd 9779	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → 𝑘 ∈ ℤ)
83	81, 82	rpexpcld 11157	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → (2↑𝑘) ∈ ℝ⁺)
84	83	rprecred 10127	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → (1 / (2↑𝑘)) ∈ ℝ)
85		cvgcmp2n.lt	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐺‘𝑘) ≤ (1 / (2↑𝑘)))
86	45, 85	syldan 282	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → (𝐺‘𝑘) ≤ (1 / (2↑𝑘)))
87	41, 51, 84, 86	fsumle 12256	. . . . . 6 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) ≤ Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(1 / (2↑𝑘)))
88		2cnd 9387	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → 2 ∈ ℂ)
89	81	rpap0d 10121	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → 2 # 0)
90	88, 89, 82	exprecapd 11141	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → ((1 / 2)↑𝑘) = (1 / (2↑𝑘)))
91	90	eqcomd 2244	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → (1 / (2↑𝑘)) = ((1 / 2)↑𝑘))
92	91	sumeq2dv 12160	. . . . . 6 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(1 / (2↑𝑘)) = Σ𝑘 ∈ ((𝑀 + 1)...𝑁)((1 / 2)↑𝑘))
93	87, 92	breqtrd 4157	. . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) ≤ Σ𝑘 ∈ ((𝑀 + 1)...𝑁)((1 / 2)↑𝑘))
94		fzval3 10640	. . . . . . 7 ⊢ (𝑁 ∈ ℤ → ((𝑀 + 1)...𝑁) = ((𝑀 + 1)..^(𝑁 + 1)))
95	28, 94	syl 14	. . . . . 6 ⊢ (𝜑 → ((𝑀 + 1)...𝑁) = ((𝑀 + 1)..^(𝑁 + 1)))
96	95	sumeq1d 12158	. . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)((1 / 2)↑𝑘) = Σ𝑘 ∈ ((𝑀 + 1)..^(𝑁 + 1))((1 / 2)↑𝑘))
97	93, 96	breqtrd 4157	. . . 4 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) ≤ Σ𝑘 ∈ ((𝑀 + 1)..^(𝑁 + 1))((1 / 2)↑𝑘))
98		halfcn 9531	. . . . . 6 ⊢ (1 / 2) ∈ ℂ
99	98	a1i 9	. . . . 5 ⊢ (𝜑 → (1 / 2) ∈ ℂ)
100		1re 8332	. . . . . . 7 ⊢ 1 ∈ ℝ
101		halflt1 9534	. . . . . . 7 ⊢ (1 / 2) < 1
102	62, 100, 101	ltapii 8972	. . . . . 6 ⊢ (1 / 2) # 1
103	102	a1i 9	. . . . 5 ⊢ (𝜑 → (1 / 2) # 1)
104		eluzp1p1 9965	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (𝑁 + 1) ∈ (ℤ_≥‘(𝑀 + 1)))
105	3, 104	syl 14	. . . . 5 ⊢ (𝜑 → (𝑁 + 1) ∈ (ℤ_≥‘(𝑀 + 1)))
106	99, 103, 64, 105	geosergap 12299	. . . 4 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)..^(𝑁 + 1))((1 / 2)↑𝑘) = ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 − (1 / 2))))
107	97, 106	breqtrd 4157	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) ≤ ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 − (1 / 2))))
108	73	a1i 9	. . . . . . . 8 ⊢ (𝜑 → (1 / 2) ∈ ℝ⁺)
109	28	peano2zd 9783	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ∈ ℤ)
110	108, 109	rpexpcld 11157	. . . . . . 7 ⊢ (𝜑 → ((1 / 2)↑(𝑁 + 1)) ∈ ℝ⁺)
111	110	rpred 10115	. . . . . 6 ⊢ (𝜑 → ((1 / 2)↑(𝑁 + 1)) ∈ ℝ)
112	65, 111	resubcld 8716	. . . . 5 ⊢ (𝜑 → (((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) ∈ ℝ)
113	2	nnrecred 9361	. . . . 5 ⊢ (𝜑 → (1 / 𝑀) ∈ ℝ)
114	65, 110	ltsubrpd 10148	. . . . . 6 ⊢ (𝜑 → (((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) < ((1 / 2)↑(𝑀 + 1)))
115		2cnd 9387	. . . . . . . 8 ⊢ (𝜑 → 2 ∈ ℂ)
116	77	rpap0d 10121	. . . . . . . 8 ⊢ (𝜑 → 2 # 0)
117	115, 116, 40	exprecapd 11141	. . . . . . 7 ⊢ (𝜑 → ((1 / 2)↑(𝑀 + 1)) = (1 / (2↑(𝑀 + 1))))
118	42	nnred 9327	. . . . . . . . 9 ⊢ (𝜑 → (𝑀 + 1) ∈ ℝ)
119	77, 40	rpexpcld 11157	. . . . . . . . . 10 ⊢ (𝜑 → (2↑(𝑀 + 1)) ∈ ℝ⁺)
120	119	rpred 10115	. . . . . . . . 9 ⊢ (𝜑 → (2↑(𝑀 + 1)) ∈ ℝ)
121		2z 9684	. . . . . . . . . . . 12 ⊢ 2 ∈ ℤ
122		uzid 9953	. . . . . . . . . . . 12 ⊢ (2 ∈ ℤ → 2 ∈ (ℤ_≥‘2))
123	121, 122	ax-mp 5	. . . . . . . . . . 11 ⊢ 2 ∈ (ℤ_≥‘2)
124	123	a1i 9	. . . . . . . . . 10 ⊢ (𝜑 → 2 ∈ (ℤ_≥‘2))
125		bernneq3 11122	. . . . . . . . . 10 ⊢ ((2 ∈ (ℤ_≥‘2) ∧ (𝑀 + 1) ∈ ℕ₀) → (𝑀 + 1) < (2↑(𝑀 + 1)))
126	124, 64, 125	syl2anc 415	. . . . . . . . 9 ⊢ (𝜑 → (𝑀 + 1) < (2↑(𝑀 + 1)))
127	17, 118, 120, 18, 126	lttrd 8460	. . . . . . . 8 ⊢ (𝜑 → 𝑀 < (2↑(𝑀 + 1)))
128	78, 119	ltrecd 10134	. . . . . . . 8 ⊢ (𝜑 → (𝑀 < (2↑(𝑀 + 1)) ↔ (1 / (2↑(𝑀 + 1))) < (1 / 𝑀)))
129	127, 128	mpbid 147	. . . . . . 7 ⊢ (𝜑 → (1 / (2↑(𝑀 + 1))) < (1 / 𝑀))
130	117, 129	eqbrtrd 4153	. . . . . 6 ⊢ (𝜑 → ((1 / 2)↑(𝑀 + 1)) < (1 / 𝑀))
131	112, 65, 113, 114, 130	lttrd 8460	. . . . 5 ⊢ (𝜑 → (((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) < (1 / 𝑀))
132	112, 113, 77, 131	ltmul1dd 10171	. . . 4 ⊢ (𝜑 → ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) · 2) < ((1 / 𝑀) · 2))
133	70	oveq2i 6099	. . . . . 6 ⊢ ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 − (1 / 2))) = ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 / 2))
134	112	recnd 8361	. . . . . . 7 ⊢ (𝜑 → (((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) ∈ ℂ)
135		1cnd 8349	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℂ)
136		1ap0 8927	. . . . . . . 8 ⊢ 1 # 0
137	136	a1i 9	. . . . . . 7 ⊢ (𝜑 → 1 # 0)
138	134, 135, 115, 137, 116	divdivap2d 9162	. . . . . 6 ⊢ (𝜑 → ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 / 2)) = (((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) · 2) / 1))
139	133, 138	eqtrid 2283	. . . . 5 ⊢ (𝜑 → ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 − (1 / 2))) = (((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) · 2) / 1))
140	134, 115	mulcld 8353	. . . . . 6 ⊢ (𝜑 → ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) · 2) ∈ ℂ)
141	140	div1d 9119	. . . . 5 ⊢ (𝜑 → (((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) · 2) / 1) = ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) · 2))
142	139, 141	eqtrd 2271	. . . 4 ⊢ (𝜑 → ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 − (1 / 2))) = ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) · 2))
143	17	recnd 8361	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℂ)
144	2	nnap0d 9360	. . . . 5 ⊢ (𝜑 → 𝑀 # 0)
145	115, 143, 144	divrecap2d 9133	. . . 4 ⊢ (𝜑 → (2 / 𝑀) = ((1 / 𝑀) · 2))
146	132, 142, 145	3brtr4d 4163	. . 3 ⊢ (𝜑 → ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 − (1 / 2))) < (2 / 𝑀))
147	52, 76, 80, 107, 146	lelttrd 8459	. 2 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) < (2 / 𝑀))
148	61, 147	eqbrtrd 4153	1 ⊢ (𝜑 → (abs‘((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀))) < (2 / 𝑀))

Colors of variables: wff set class

This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ∪ cun 3218 ∩ cin 3219 ∅c0 3520 class class class wbr 4131 ‘cfv 5380 (class class class)co 6088 ℂcc 8184 ℝcr 8185 0cc0 8186 1c1 8187 + caddc 8189 · cmul 8191 < clt 8367 ≤ cle 8368 − cmin 8505 # cap 8918 / cdiv 9011 ℕcn 9314 2c2 9365 ℕ₀cn0 9575 ℤcz 9656 ℤ_≥cuz 9938 ℝ⁺crp 10072 ...cfz 10429 ..^cfzo 10567 seqcseq 10906 ↑cexp 10997 abscabs 11786 Σcsu 12145

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4248 ax-sep 4251 ax-nul 4261 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-iinf 4737 ax-cnex 8277 ax-resscn 8278 ax-1cn 8279 ax-1re 8280 ax-icn 8281 ax-addcl 8282 ax-addrcl 8283 ax-mulcl 8284 ax-mulrcl 8285 ax-addcom 8286 ax-mulcom 8287 ax-addass 8288 ax-mulass 8289 ax-distr 8290 ax-i2m1 8291 ax-0lt1 8292 ax-1rid 8293 ax-0id 8294 ax-rnegex 8295 ax-precex 8296 ax-cnre 8297 ax-pre-ltirr 8298 ax-pre-ltwlin 8299 ax-pre-lttrn 8300 ax-pre-apti 8301 ax-pre-ltadd 8302 ax-pre-mulgt0 8303 ax-pre-mulext 8304 ax-arch 8305 ax-caucvg 8306

This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4132 df-opab 4194 df-mpt 4195 df-tr 4232 df-id 4440 df-po 4443 df-iso 4444 df-iord 4513 df-on 4515 df-ilim 4516 df-suc 4518 df-iom 4740 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-f1 5385 df-fo 5386 df-f1o 5387 df-fv 5388 df-isom 5389 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-1st 6378 df-2nd 6379 df-recs 6580 df-irdg 6645 df-frec 6666 df-1o 6691 df-oadd 6695 df-er 6811 df-en 7028 df-dom 7029 df-fin 7030 df-pnf 8369 df-mnf 8370 df-xr 8371 df-ltxr 8372 df-le 8373 df-sub 8507 df-neg 8508 df-reap 8912 df-ap 8919 df-div 9012 df-inn 9315 df-2 9373 df-3 9374 df-4 9375 df-n0 9576 df-z 9657 df-uz 9939 df-q 10037 df-rp 10073 df-ico 10314 df-fz 10430 df-fzo 10568 df-seqfrec 10907 df-exp 10998 df-ihash 11238 df-cj 11630 df-re 11631 df-im 11632 df-rsqrt 11787 df-abs 11788 df-clim 12071 df-sumdc 12146

This theorem is used by: cvgcmp2n 17300

W3C validator