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 17093

Description: Lemma for cvgcmp2n 17094. 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 10002	. . . . . . . . . 10 ⊢ ((𝑀 ∈ ℕ ∧ 𝑁 ∈ (ℤ_≥‘𝑀)) → 𝑁 ∈ ℕ)
5	2, 3, 4	syl2anc 415	. . . . . . . . 9 ⊢ (𝜑 → 𝑁 ∈ ℕ)
6		elnnuz 9961	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ ↔ 𝑁 ∈ (ℤ_≥‘1))
7	5, 6	sylib 122	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘1))
8		elnnuz 9961	. . . . . . . . 9 ⊢ (𝑘 ∈ ℕ ↔ 𝑘 ∈ (ℤ_≥‘1))
9		cvgcmp2n.cl	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐺‘𝑘) ∈ ℝ)
10	9	recnd 8354	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → (𝐺‘𝑘) ∈ ℂ)
11	8, 10	sylan2br 288	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘1)) → (𝐺‘𝑘) ∈ ℂ)
12	1, 7, 11	fsum3ser 12166	. . . . . . 7 ⊢ (𝜑 → Σ𝑘 ∈ (1...𝑁)(𝐺‘𝑘) = (seq1( + , 𝐺)‘𝑁))
13		nnuz 9960	. . . . . . . . 9 ⊢ ℕ = (ℤ_≥‘1)
14	2, 13	eleqtrdi 2331	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ (ℤ_≥‘1))
15	1, 14, 11	fsum3ser 12166	. . . . . . 7 ⊢ (𝜑 → Σ𝑘 ∈ (1...𝑀)(𝐺‘𝑘) = (seq1( + , 𝐺)‘𝑀))
16	12, 15	oveq12d 6103	. . . . . 6 ⊢ (𝜑 → (Σ𝑘 ∈ (1...𝑁)(𝐺‘𝑘) − Σ𝑘 ∈ (1...𝑀)(𝐺‘𝑘)) = ((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀)))
17	2	nnred 9318	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ∈ ℝ)
18	17	ltp1d 9261	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 < (𝑀 + 1))
19		fzdisj 10459	. . . . . . . . . 10 ⊢ (𝑀 < (𝑀 + 1) → ((1...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅)
20	18, 19	syl 14	. . . . . . . . 9 ⊢ (𝜑 → ((1...𝑀) ∩ ((𝑀 + 1)...𝑁)) = ∅)
21		eluzle 9936	. . . . . . . . . . . 12 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ≤ 𝑁)
22	3, 21	syl 14	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑀 ≤ 𝑁)
23		elfz1b 10499	. . . . . . . . . . 11 ⊢ (𝑀 ∈ (1...𝑁) ↔ (𝑀 ∈ ℕ ∧ 𝑁 ∈ ℕ ∧ 𝑀 ≤ 𝑁))
24	2, 5, 22, 23	syl3anbrc 1212	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ (1...𝑁))
25		fzsplit 10458	. . . . . . . . . 10 ⊢ (𝑀 ∈ (1...𝑁) → (1...𝑁) = ((1...𝑀) ∪ ((𝑀 + 1)...𝑁)))
26	24, 25	syl 14	. . . . . . . . 9 ⊢ (𝜑 → (1...𝑁) = ((1...𝑀) ∪ ((𝑀 + 1)...𝑁)))
27		1zzd 9673	. . . . . . . . . 10 ⊢ (𝜑 → 1 ∈ ℤ)
28	5	nnzd 9769	. . . . . . . . . 10 ⊢ (𝜑 → 𝑁 ∈ ℤ)
29	27, 28	fzfigd 10870	. . . . . . . . 9 ⊢ (𝜑 → (1...𝑁) ∈ Fin)
30		elfznn 10462	. . . . . . . . . 10 ⊢ (𝑘 ∈ (1...𝑁) → 𝑘 ∈ ℕ)
31	30, 10	sylan2 286	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝑁)) → (𝐺‘𝑘) ∈ ℂ)
32	20, 26, 29, 31	fsumsplit 12176	. . . . . . . 8 ⊢ (𝜑 → Σ𝑘 ∈ (1...𝑁)(𝐺‘𝑘) = (Σ𝑘 ∈ (1...𝑀)(𝐺‘𝑘) + Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘)))
33	32	eqcomd 2244	. . . . . . 7 ⊢ (𝜑 → (Σ𝑘 ∈ (1...𝑀)(𝐺‘𝑘) + Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘)) = Σ𝑘 ∈ (1...𝑁)(𝐺‘𝑘))
34	29, 31	fsumcl 12169	. . . . . . . 8 ⊢ (𝜑 → Σ𝑘 ∈ (1...𝑁)(𝐺‘𝑘) ∈ ℂ)
35	2	nnzd 9769	. . . . . . . . . 10 ⊢ (𝜑 → 𝑀 ∈ ℤ)
36	27, 35	fzfigd 10870	. . . . . . . . 9 ⊢ (𝜑 → (1...𝑀) ∈ Fin)
37		elfznn 10462	. . . . . . . . . 10 ⊢ (𝑘 ∈ (1...𝑀) → 𝑘 ∈ ℕ)
38	37, 10	sylan2 286	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ (1...𝑀)) → (𝐺‘𝑘) ∈ ℂ)
39	36, 38	fsumcl 12169	. . . . . . . 8 ⊢ (𝜑 → Σ𝑘 ∈ (1...𝑀)(𝐺‘𝑘) ∈ ℂ)
40	35	peano2zd 9773	. . . . . . . . . 10 ⊢ (𝜑 → (𝑀 + 1) ∈ ℤ)
41	40, 28	fzfigd 10870	. . . . . . . . 9 ⊢ (𝜑 → ((𝑀 + 1)...𝑁) ∈ Fin)
42	2	peano2nnd 9320	. . . . . . . . . . 11 ⊢ (𝜑 → (𝑀 + 1) ∈ ℕ)
43		elfzuz 10426	. . . . . . . . . . 11 ⊢ (𝑘 ∈ ((𝑀 + 1)...𝑁) → 𝑘 ∈ (ℤ_≥‘(𝑀 + 1)))
44		eluznn 10002	. . . . . . . . . . 11 ⊢ (((𝑀 + 1) ∈ ℕ ∧ 𝑘 ∈ (ℤ_≥‘(𝑀 + 1))) → 𝑘 ∈ ℕ)
45	42, 43, 44	syl2an 289	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → 𝑘 ∈ ℕ)
46	45, 10	syldan 282	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → (𝐺‘𝑘) ∈ ℂ)
47	41, 46	fsumcl 12169	. . . . . . . 8 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) ∈ ℂ)
48	34, 39, 47	subaddd 8655	. . . . . . 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 12170	. . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) ∈ ℝ)
53	50, 52	eqeltrd 2315	. . . 4 ⊢ (𝜑 → ((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀)) ∈ ℝ)
54	42	nnzd 9769	. . . . . . 7 ⊢ (𝜑 → (𝑀 + 1) ∈ ℤ)
55	54, 28	fzfigd 10870	. . . . . 6 ⊢ (𝜑 → ((𝑀 + 1)...𝑁) ∈ Fin)
56		cvgcmp2n.ge0	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ℕ) → 0 ≤ (𝐺‘𝑘))
57	45, 56	syldan 282	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → 0 ≤ (𝐺‘𝑘))
58	55, 51, 57	fsumge0 12228	. . . . 5 ⊢ (𝜑 → 0 ≤ Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘))
59	58, 50	breqtrrd 4158	. . . 4 ⊢ (𝜑 → 0 ≤ ((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀)))
60	53, 59	absidd 11935	. . 3 ⊢ (𝜑 → (abs‘((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀))) = ((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀)))
61	60, 50	eqtrd 2271	. 2 ⊢ (𝜑 → (abs‘((seq1( + , 𝐺)‘𝑁) − (seq1( + , 𝐺)‘𝑀))) = Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘))
62		halfre 9520	. . . . . . 7 ⊢ (1 / 2) ∈ ℝ
63	62	a1i 9	. . . . . 6 ⊢ (𝜑 → (1 / 2) ∈ ℝ)
64	42	nnnn0d 9622	. . . . . 6 ⊢ (𝜑 → (𝑀 + 1) ∈ ℕ₀)
65	63, 64	reexpcld 11130	. . . . 5 ⊢ (𝜑 → ((1 / 2)↑(𝑀 + 1)) ∈ ℝ)
66	5	peano2nnd 9320	. . . . . . 7 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ)
67	66	nnnn0d 9622	. . . . . 6 ⊢ (𝜑 → (𝑁 + 1) ∈ ℕ₀)
68	63, 67	reexpcld 11130	. . . . 5 ⊢ (𝜑 → ((1 / 2)↑(𝑁 + 1)) ∈ ℝ)
69	65, 68	resubcld 8708	. . . 4 ⊢ (𝜑 → (((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) ∈ ℝ)
70		1mhlfehlf 9525	. . . . . 6 ⊢ (1 − (1 / 2)) = (1 / 2)
71		2rp 10061	. . . . . . 7 ⊢ 2 ∈ ℝ⁺
72		rpreccl 10083	. . . . . . 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 10131	. . 3 ⊢ (𝜑 → ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 − (1 / 2))) ∈ ℝ)
77	71	a1i 9	. . . . 5 ⊢ (𝜑 → 2 ∈ ℝ⁺)
78	2	nnrpd 10097	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℝ⁺)
79	77, 78	rpdivcld 10117	. . . 4 ⊢ (𝜑 → (2 / 𝑀) ∈ ℝ⁺)
80	79	rpred 10099	. . 3 ⊢ (𝜑 → (2 / 𝑀) ∈ ℝ)
81	71	a1i 9	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → 2 ∈ ℝ⁺)
82	45	nnzd 9769	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → 𝑘 ∈ ℤ)
83	81, 82	rpexpcld 11137	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → (2↑𝑘) ∈ ℝ⁺)
84	83	rprecred 10111	. . . . . . 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 12232	. . . . . 6 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) ≤ Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(1 / (2↑𝑘)))
88		2cnd 9378	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → 2 ∈ ℂ)
89	81	rpap0d 10105	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → 2 # 0)
90	88, 89, 82	exprecapd 11121	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → ((1 / 2)↑𝑘) = (1 / (2↑𝑘)))
91	90	eqcomd 2244	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ ((𝑀 + 1)...𝑁)) → (1 / (2↑𝑘)) = ((1 / 2)↑𝑘))
92	91	sumeq2dv 12136	. . . . . 6 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(1 / (2↑𝑘)) = Σ𝑘 ∈ ((𝑀 + 1)...𝑁)((1 / 2)↑𝑘))
93	87, 92	breqtrd 4156	. . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) ≤ Σ𝑘 ∈ ((𝑀 + 1)...𝑁)((1 / 2)↑𝑘))
94		fzval3 10624	. . . . . . 7 ⊢ (𝑁 ∈ ℤ → ((𝑀 + 1)...𝑁) = ((𝑀 + 1)..^(𝑁 + 1)))
95	28, 94	syl 14	. . . . . 6 ⊢ (𝜑 → ((𝑀 + 1)...𝑁) = ((𝑀 + 1)..^(𝑁 + 1)))
96	95	sumeq1d 12134	. . . . 5 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)((1 / 2)↑𝑘) = Σ𝑘 ∈ ((𝑀 + 1)..^(𝑁 + 1))((1 / 2)↑𝑘))
97	93, 96	breqtrd 4156	. . . 4 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) ≤ Σ𝑘 ∈ ((𝑀 + 1)..^(𝑁 + 1))((1 / 2)↑𝑘))
98		halfcn 9521	. . . . . 6 ⊢ (1 / 2) ∈ ℂ
99	98	a1i 9	. . . . 5 ⊢ (𝜑 → (1 / 2) ∈ ℂ)
100		1re 8325	. . . . . . 7 ⊢ 1 ∈ ℝ
101		halflt1 9524	. . . . . . 7 ⊢ (1 / 2) < 1
102	62, 100, 101	ltapii 8964	. . . . . 6 ⊢ (1 / 2) # 1
103	102	a1i 9	. . . . 5 ⊢ (𝜑 → (1 / 2) # 1)
104		eluzp1p1 9950	. . . . . 6 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → (𝑁 + 1) ∈ (ℤ_≥‘(𝑀 + 1)))
105	3, 104	syl 14	. . . . 5 ⊢ (𝜑 → (𝑁 + 1) ∈ (ℤ_≥‘(𝑀 + 1)))
106	99, 103, 64, 105	geosergap 12275	. . . 4 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)..^(𝑁 + 1))((1 / 2)↑𝑘) = ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 − (1 / 2))))
107	97, 106	breqtrd 4156	. . 3 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) ≤ ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 − (1 / 2))))
108	73	a1i 9	. . . . . . . 8 ⊢ (𝜑 → (1 / 2) ∈ ℝ⁺)
109	28	peano2zd 9773	. . . . . . . 8 ⊢ (𝜑 → (𝑁 + 1) ∈ ℤ)
110	108, 109	rpexpcld 11137	. . . . . . 7 ⊢ (𝜑 → ((1 / 2)↑(𝑁 + 1)) ∈ ℝ⁺)
111	110	rpred 10099	. . . . . 6 ⊢ (𝜑 → ((1 / 2)↑(𝑁 + 1)) ∈ ℝ)
112	65, 111	resubcld 8708	. . . . 5 ⊢ (𝜑 → (((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) ∈ ℝ)
113	2	nnrecred 9352	. . . . 5 ⊢ (𝜑 → (1 / 𝑀) ∈ ℝ)
114	65, 110	ltsubrpd 10132	. . . . . 6 ⊢ (𝜑 → (((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) < ((1 / 2)↑(𝑀 + 1)))
115		2cnd 9378	. . . . . . . 8 ⊢ (𝜑 → 2 ∈ ℂ)
116	77	rpap0d 10105	. . . . . . . 8 ⊢ (𝜑 → 2 # 0)
117	115, 116, 40	exprecapd 11121	. . . . . . 7 ⊢ (𝜑 → ((1 / 2)↑(𝑀 + 1)) = (1 / (2↑(𝑀 + 1))))
118	42	nnred 9318	. . . . . . . . 9 ⊢ (𝜑 → (𝑀 + 1) ∈ ℝ)
119	77, 40	rpexpcld 11137	. . . . . . . . . 10 ⊢ (𝜑 → (2↑(𝑀 + 1)) ∈ ℝ⁺)
120	119	rpred 10099	. . . . . . . . 9 ⊢ (𝜑 → (2↑(𝑀 + 1)) ∈ ℝ)
121		2z 9674	. . . . . . . . . . . 12 ⊢ 2 ∈ ℤ
122		uzid 9938	. . . . . . . . . . . 12 ⊢ (2 ∈ ℤ → 2 ∈ (ℤ_≥‘2))
123	121, 122	ax-mp 5	. . . . . . . . . . 11 ⊢ 2 ∈ (ℤ_≥‘2)
124	123	a1i 9	. . . . . . . . . 10 ⊢ (𝜑 → 2 ∈ (ℤ_≥‘2))
125		bernneq3 11102	. . . . . . . . . 10 ⊢ ((2 ∈ (ℤ_≥‘2) ∧ (𝑀 + 1) ∈ ℕ₀) → (𝑀 + 1) < (2↑(𝑀 + 1)))
126	124, 64, 125	syl2anc 415	. . . . . . . . 9 ⊢ (𝜑 → (𝑀 + 1) < (2↑(𝑀 + 1)))
127	17, 118, 120, 18, 126	lttrd 8452	. . . . . . . 8 ⊢ (𝜑 → 𝑀 < (2↑(𝑀 + 1)))
128	78, 119	ltrecd 10118	. . . . . . . 8 ⊢ (𝜑 → (𝑀 < (2↑(𝑀 + 1)) ↔ (1 / (2↑(𝑀 + 1))) < (1 / 𝑀)))
129	127, 128	mpbid 147	. . . . . . 7 ⊢ (𝜑 → (1 / (2↑(𝑀 + 1))) < (1 / 𝑀))
130	117, 129	eqbrtrd 4152	. . . . . 6 ⊢ (𝜑 → ((1 / 2)↑(𝑀 + 1)) < (1 / 𝑀))
131	112, 65, 113, 114, 130	lttrd 8452	. . . . 5 ⊢ (𝜑 → (((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) < (1 / 𝑀))
132	112, 113, 77, 131	ltmul1dd 10155	. . . 4 ⊢ (𝜑 → ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) · 2) < ((1 / 𝑀) · 2))
133	70	oveq2i 6096	. . . . . 6 ⊢ ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 − (1 / 2))) = ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 / 2))
134	112	recnd 8354	. . . . . . 7 ⊢ (𝜑 → (((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) ∈ ℂ)
135		1cnd 8342	. . . . . . 7 ⊢ (𝜑 → 1 ∈ ℂ)
136		1ap0 8919	. . . . . . . 8 ⊢ 1 # 0
137	136	a1i 9	. . . . . . 7 ⊢ (𝜑 → 1 # 0)
138	134, 135, 115, 137, 116	divdivap2d 9154	. . . . . 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 8346	. . . . . 6 ⊢ (𝜑 → ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) · 2) ∈ ℂ)
141	140	div1d 9111	. . . . 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 8354	. . . . 5 ⊢ (𝜑 → 𝑀 ∈ ℂ)
144	2	nnap0d 9351	. . . . 5 ⊢ (𝜑 → 𝑀 # 0)
145	115, 143, 144	divrecap2d 9125	. . . 4 ⊢ (𝜑 → (2 / 𝑀) = ((1 / 𝑀) · 2))
146	132, 142, 145	3brtr4d 4162	. . 3 ⊢ (𝜑 → ((((1 / 2)↑(𝑀 + 1)) − ((1 / 2)↑(𝑁 + 1))) / (1 − (1 / 2))) < (2 / 𝑀))
147	52, 76, 80, 107, 146	lelttrd 8451	. 2 ⊢ (𝜑 → Σ𝑘 ∈ ((𝑀 + 1)...𝑁)(𝐺‘𝑘) < (2 / 𝑀))
148	61, 147	eqbrtrd 4152	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 4130 ‘cfv 5377 (class class class)co 6085 ℂcc 8177 ℝcr 8178 0cc0 8179 1c1 8180 + caddc 8182 · cmul 8184 < clt 8360 ≤ cle 8361 − cmin 8497 # cap 8910 / cdiv 9003 ℕcn 9305 2c2 9356 ℕ₀cn0 9565 ℤcz 9646 ℤ_≥cuz 9923 ℝ⁺crp 10056 ...cfz 10413 ..^cfzo 10551 seqcseq 10886 ↑cexp 10977 abscabs 11765 Σcsu 12121

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 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-mulrcl 8278 ax-addcom 8279 ax-mulcom 8280 ax-addass 8281 ax-mulass 8282 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-1rid 8286 ax-0id 8287 ax-rnegex 8288 ax-precex 8289 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295 ax-pre-mulgt0 8296 ax-pre-mulext 8297 ax-arch 8298 ax-caucvg 8299

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 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-po 4441 df-iso 4442 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-isom 5386 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-irdg 6641 df-frec 6662 df-1o 6687 df-oadd 6691 df-er 6807 df-en 7023 df-dom 7024 df-fin 7025 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-reap 8904 df-ap 8911 df-div 9004 df-inn 9306 df-2 9364 df-3 9365 df-4 9366 df-n0 9566 df-z 9647 df-uz 9924 df-q 10022 df-rp 10057 df-ico 10298 df-fz 10414 df-fzo 10552 df-seqfrec 10887 df-exp 10978 df-ihash 11217 df-cj 11609 df-re 11610 df-im 11611 df-rsqrt 11766 df-abs 11767 df-clim 12047 df-sumdc 12122

This theorem is used by: cvgcmp2n 17094

W3C validator