cvgcmpce - Metamath Proof Explorer

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

Theorem cvgcmpce 15761

Description: A comparison test for convergence of a complex infinite series. (Contributed by NM, 25-Apr-2005.) (Revised by Mario Carneiro, 27-May-2014.)

**Hypotheses**
Ref	Expression
cvgcmpce.1	⊢ 𝑍 = (ℤ_≥‘𝑀)
cvgcmpce.2	⊢ (𝜑 → 𝑁 ∈ 𝑍)
cvgcmpce.3	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ)
cvgcmpce.4	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) ∈ ℂ)
cvgcmpce.5	⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ )
cvgcmpce.6	⊢ (𝜑 → 𝐶 ∈ ℝ)
cvgcmpce.7	⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → (abs‘(𝐺‘𝑘)) ≤ (𝐶 · (𝐹‘𝑘)))

**Assertion**
Ref	Expression
cvgcmpce	⊢ (𝜑 → seq𝑀( + , 𝐺) ∈ dom ⇝ )

Distinct variable groups: 𝐶,𝑘 𝑘,𝐹 𝑘,𝐺 𝑘,𝑁 𝑘,𝑍 𝑘,𝑀 𝜑,𝑘

Proof of Theorem cvgcmpce Dummy variables 𝑚 𝑗 𝑛 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		cvgcmpce.1	. 2 ⊢ 𝑍 = (ℤ_≥‘𝑀)
2		cvgcmpce.2	. . . . . 6 ⊢ (𝜑 → 𝑁 ∈ 𝑍)
3	2, 1	eleqtrdi 2844	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
4		eluzel2 12824	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℤ)
5	3, 4	syl 17	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ)
6		cvgcmpce.4	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) ∈ ℂ)
7	1, 5, 6	serf 13993	. . 3 ⊢ (𝜑 → seq𝑀( + , 𝐺):𝑍⟶ℂ)
8	7	ffvelcdmda 7084	. 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ)
9		fveq2 6889	. . . . . . . . 9 ⊢ (𝑚 = 𝑘 → (𝐹‘𝑚) = (𝐹‘𝑘))
10	9	oveq2d 7422	. . . . . . . 8 ⊢ (𝑚 = 𝑘 → (𝐶 · (𝐹‘𝑚)) = (𝐶 · (𝐹‘𝑘)))
11		eqid 2733	. . . . . . . 8 ⊢ (𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚))) = (𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))
12		ovex 7439	. . . . . . . 8 ⊢ (𝐶 · (𝐹‘𝑘)) ∈ V
13	10, 11, 12	fvmpt 6996	. . . . . . 7 ⊢ (𝑘 ∈ 𝑍 → ((𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))‘𝑘) = (𝐶 · (𝐹‘𝑘)))
14	13	adantl 483	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))‘𝑘) = (𝐶 · (𝐹‘𝑘)))
15		cvgcmpce.6	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℝ)
16	15	adantr 482	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐶 ∈ ℝ)
17		cvgcmpce.3	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ)
18	16, 17	remulcld 11241	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐶 · (𝐹‘𝑘)) ∈ ℝ)
19	14, 18	eqeltrd 2834	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))‘𝑘) ∈ ℝ)
20		2fveq3 6894	. . . . . . . 8 ⊢ (𝑚 = 𝑘 → (abs‘(𝐺‘𝑚)) = (abs‘(𝐺‘𝑘)))
21		eqid 2733	. . . . . . . 8 ⊢ (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))) = (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))
22		fvex 6902	. . . . . . . 8 ⊢ (abs‘(𝐺‘𝑘)) ∈ V
23	20, 21, 22	fvmpt 6996	. . . . . . 7 ⊢ (𝑘 ∈ 𝑍 → ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘) = (abs‘(𝐺‘𝑘)))
24	23	adantl 483	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘) = (abs‘(𝐺‘𝑘)))
25	6	abscld 15380	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (abs‘(𝐺‘𝑘)) ∈ ℝ)
26	24, 25	eqeltrd 2834	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘) ∈ ℝ)
27	15	recnd 11239	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ)
28		cvgcmpce.5	. . . . . . . 8 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ )
29		climdm 15495	. . . . . . . 8 ⊢ (seq𝑀( + , 𝐹) ∈ dom ⇝ ↔ seq𝑀( + , 𝐹) ⇝ ( ⇝ ‘seq𝑀( + , 𝐹)))
30	28, 29	sylib 217	. . . . . . 7 ⊢ (𝜑 → seq𝑀( + , 𝐹) ⇝ ( ⇝ ‘seq𝑀( + , 𝐹)))
31	17	recnd 11239	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ)
32	1, 5, 27, 30, 31, 14	isermulc2 15601	. . . . . 6 ⊢ (𝜑 → seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))) ⇝ (𝐶 · ( ⇝ ‘seq𝑀( + , 𝐹))))
33		climrel 15433	. . . . . . 7 ⊢ Rel ⇝
34	33	releldmi 5946	. . . . . 6 ⊢ (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))) ⇝ (𝐶 · ( ⇝ ‘seq𝑀( + , 𝐹))) → seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))) ∈ dom ⇝ )
35	32, 34	syl 17	. . . . 5 ⊢ (𝜑 → seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))) ∈ dom ⇝ )
36	1	uztrn2 12838	. . . . . . 7 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 𝑘 ∈ 𝑍)
37	2, 36	sylan 581	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 𝑘 ∈ 𝑍)
38	6	absge0d 15388	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ (abs‘(𝐺‘𝑘)))
39	38, 24	breqtrrd 5176	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘))
40	37, 39	syldan 592	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 0 ≤ ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘))
41		cvgcmpce.7	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → (abs‘(𝐺‘𝑘)) ≤ (𝐶 · (𝐹‘𝑘)))
42	37, 23	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘) = (abs‘(𝐺‘𝑘)))
43	37, 13	syl 17	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → ((𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))‘𝑘) = (𝐶 · (𝐹‘𝑘)))
44	41, 42, 43	3brtr4d 5180	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘) ≤ ((𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))‘𝑘))
45	1, 2, 19, 26, 35, 40, 44	cvgcmp 15759	. . . 4 ⊢ (𝜑 → seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))) ∈ dom ⇝ )
46	1	climcau 15614	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))) ∈ dom ⇝ ) → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥)
47	5, 45, 46	syl2anc 585	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥)
48	1, 5, 26	serfre 13994	. . . . . . . . . . . . 13 ⊢ (𝜑 → seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))):𝑍⟶ℝ)
49	48	ad2antrr 725	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))):𝑍⟶ℝ)
50	1	uztrn2 12838	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑛 ∈ 𝑍)
51	50	adantl 483	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑛 ∈ 𝑍)
52	49, 51	ffvelcdmd 7085	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) ∈ ℝ)
53		simprl 770	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑗 ∈ 𝑍)
54	49, 53	ffvelcdmd 7085	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗) ∈ ℝ)
55	52, 54	resubcld 11639	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) ∈ ℝ)
56		0red 11214	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 0 ∈ ℝ)
57	7	ad2antrr 725	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → seq𝑀( + , 𝐺):𝑍⟶ℂ)
58	57, 51	ffvelcdmd 7085	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ)
59	57, 53	ffvelcdmd 7085	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (seq𝑀( + , 𝐺)‘𝑗) ∈ ℂ)
60	58, 59	subcld 11568	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗)) ∈ ℂ)
61	60	abscld 15380	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) ∈ ℝ)
62	60	absge0d 15388	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 0 ≤ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))))
63		fzfid 13935	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝑀...𝑛) ∈ Fin)
64		difss 4131	. . . . . . . . . . . . . 14 ⊢ ((𝑀...𝑛) ∖ (𝑀...𝑗)) ⊆ (𝑀...𝑛)
65		ssfi 9170	. . . . . . . . . . . . . 14 ⊢ (((𝑀...𝑛) ∈ Fin ∧ ((𝑀...𝑛) ∖ (𝑀...𝑗)) ⊆ (𝑀...𝑛)) → ((𝑀...𝑛) ∖ (𝑀...𝑗)) ∈ Fin)
66	63, 64, 65	sylancl 587	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝑀...𝑛) ∖ (𝑀...𝑗)) ∈ Fin)
67		eldifi 4126	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗)) → 𝑘 ∈ (𝑀...𝑛))
68		simpll 766	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝜑)
69		elfzuz 13494	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ (ℤ_≥‘𝑀))
70	69, 1	eleqtrrdi 2845	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ 𝑍)
71	68, 70, 6	syl2an 597	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) ∈ ℂ)
72	67, 71	sylan2 594	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))) → (𝐺‘𝑘) ∈ ℂ)
73	66, 72	fsumabs 15744	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (abs‘Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(𝐺‘𝑘)) ≤ Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(abs‘(𝐺‘𝑘)))
74		eqidd 2734	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) = (𝐺‘𝑘))
75	51, 1	eleqtrdi 2844	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑛 ∈ (ℤ_≥‘𝑀))
76	74, 75, 71	fsumser 15673	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑛)(𝐺‘𝑘) = (seq𝑀( + , 𝐺)‘𝑛))
77		eqidd 2734	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐺‘𝑘) = (𝐺‘𝑘))
78	53, 1	eleqtrdi 2844	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑗 ∈ (ℤ_≥‘𝑀))
79		elfzuz 13494	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (𝑀...𝑗) → 𝑘 ∈ (ℤ_≥‘𝑀))
80	79, 1	eleqtrrdi 2845	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (𝑀...𝑗) → 𝑘 ∈ 𝑍)
81	68, 80, 6	syl2an 597	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐺‘𝑘) ∈ ℂ)
82	77, 78, 81	fsumser 15673	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑗)(𝐺‘𝑘) = (seq𝑀( + , 𝐺)‘𝑗))
83	76, 82	oveq12d 7424	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (Σ𝑘 ∈ (𝑀...𝑛)(𝐺‘𝑘) − Σ𝑘 ∈ (𝑀...𝑗)(𝐺‘𝑘)) = ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗)))
84		fzfid 13935	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝑀...𝑗) ∈ Fin)
85	84, 81	fsumcl 15676	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑗)(𝐺‘𝑘) ∈ ℂ)
86	66, 72	fsumcl 15676	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(𝐺‘𝑘) ∈ ℂ)
87		disjdif 4471	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀...𝑗) ∩ ((𝑀...𝑛) ∖ (𝑀...𝑗))) = ∅
88	87	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝑀...𝑗) ∩ ((𝑀...𝑛) ∖ (𝑀...𝑗))) = ∅)
89		undif2 4476	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀...𝑗) ∪ ((𝑀...𝑛) ∖ (𝑀...𝑗))) = ((𝑀...𝑗) ∪ (𝑀...𝑛))
90		fzss2 13538	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ (ℤ_≥‘𝑗) → (𝑀...𝑗) ⊆ (𝑀...𝑛))
91	90	ad2antll 728	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝑀...𝑗) ⊆ (𝑀...𝑛))
92		ssequn1 4180	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑀...𝑗) ⊆ (𝑀...𝑛) ↔ ((𝑀...𝑗) ∪ (𝑀...𝑛)) = (𝑀...𝑛))
93	91, 92	sylib 217	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝑀...𝑗) ∪ (𝑀...𝑛)) = (𝑀...𝑛))
94	89, 93	eqtr2id 2786	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝑀...𝑛) = ((𝑀...𝑗) ∪ ((𝑀...𝑛) ∖ (𝑀...𝑗))))
95	88, 94, 63, 71	fsumsplit 15684	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑛)(𝐺‘𝑘) = (Σ𝑘 ∈ (𝑀...𝑗)(𝐺‘𝑘) + Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(𝐺‘𝑘)))
96	85, 86, 95	mvrladdd 11624	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (Σ𝑘 ∈ (𝑀...𝑛)(𝐺‘𝑘) − Σ𝑘 ∈ (𝑀...𝑗)(𝐺‘𝑘)) = Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(𝐺‘𝑘))
97	83, 96	eqtr3d 2775	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗)) = Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(𝐺‘𝑘))
98	97	fveq2d 6893	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) = (abs‘Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(𝐺‘𝑘)))
99	70	adantl 483	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑛)) → 𝑘 ∈ 𝑍)
100	99, 23	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑛)) → ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘) = (abs‘(𝐺‘𝑘)))
101		abscl 15222	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐺‘𝑘) ∈ ℂ → (abs‘(𝐺‘𝑘)) ∈ ℝ)
102	101	recnd 11239	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺‘𝑘) ∈ ℂ → (abs‘(𝐺‘𝑘)) ∈ ℂ)
103	71, 102	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (abs‘(𝐺‘𝑘)) ∈ ℂ)
104	100, 75, 103	fsumser 15673	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑛)(abs‘(𝐺‘𝑘)) = (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛))
105	80	adantl 483	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑗)) → 𝑘 ∈ 𝑍)
106	105, 23	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑗)) → ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘) = (abs‘(𝐺‘𝑘)))
107	81, 102	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑗)) → (abs‘(𝐺‘𝑘)) ∈ ℂ)
108	106, 78, 107	fsumser 15673	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑗)(abs‘(𝐺‘𝑘)) = (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))
109	104, 108	oveq12d 7424	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (Σ𝑘 ∈ (𝑀...𝑛)(abs‘(𝐺‘𝑘)) − Σ𝑘 ∈ (𝑀...𝑗)(abs‘(𝐺‘𝑘))) = ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)))
110	84, 107	fsumcl 15676	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑗)(abs‘(𝐺‘𝑘)) ∈ ℂ)
111	72, 102	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))) → (abs‘(𝐺‘𝑘)) ∈ ℂ)
112	66, 111	fsumcl 15676	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(abs‘(𝐺‘𝑘)) ∈ ℂ)
113	88, 94, 63, 103	fsumsplit 15684	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑛)(abs‘(𝐺‘𝑘)) = (Σ𝑘 ∈ (𝑀...𝑗)(abs‘(𝐺‘𝑘)) + Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(abs‘(𝐺‘𝑘))))
114	110, 112, 113	mvrladdd 11624	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (Σ𝑘 ∈ (𝑀...𝑛)(abs‘(𝐺‘𝑘)) − Σ𝑘 ∈ (𝑀...𝑗)(abs‘(𝐺‘𝑘))) = Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(abs‘(𝐺‘𝑘)))
115	109, 114	eqtr3d 2775	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) = Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(abs‘(𝐺‘𝑘)))
116	73, 98, 115	3brtr4d 5180	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) ≤ ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)))
117	56, 61, 55, 62, 116	letrd 11368	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 0 ≤ ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)))
118	55, 117	absidd 15366	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) = ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)))
119	118	breq1d 5158	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥 ↔ ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) < 𝑥))
120		rpre 12979	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ℝ⁺ → 𝑥 ∈ ℝ)
121	120	ad2antlr 726	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑥 ∈ ℝ)
122		lelttr 11301	. . . . . . . . . 10 ⊢ (((abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) ∈ ℝ ∧ ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → (((abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) ≤ ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) ∧ ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) < 𝑥) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥))
123	61, 55, 121, 122	syl3anc 1372	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (((abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) ≤ ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) ∧ ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) < 𝑥) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥))
124	116, 123	mpand 694	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) < 𝑥 → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥))
125	119, 124	sylbid 239	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥 → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥))
126	125	anassrs 469	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → ((abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥 → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥))
127	126	ralimdva 3168	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) → (∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥 → ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥))
128	127	reximdva 3169	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥 → ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥))
129	128	ralimdva 3168	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥))
130	47, 129	mpd 15	. 2 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥)
131		seqex 13965	. . 3 ⊢ seq𝑀( + , 𝐺) ∈ V
132	131	a1i 11	. 2 ⊢ (𝜑 → seq𝑀( + , 𝐺) ∈ V)
133	1, 8, 130, 132	caucvg 15622	1 ⊢ (𝜑 → seq𝑀( + , 𝐺) ∈ dom ⇝ )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 Vcvv 3475 ∖ cdif 3945 ∪ cun 3946 ∩ cin 3947 ⊆ wss 3948 ∅c0 4322 class class class wbr 5148 ↦ cmpt 5231 dom cdm 5676 ⟶wf 6537 ‘cfv 6541 (class class class)co 7406 Fincfn 8936 ℂcc 11105 ℝcr 11106 0cc0 11107 + caddc 11110 · cmul 11112 < clt 11245 ≤ cle 11246 − cmin 11441 ℤcz 12555 ℤ_≥cuz 12819 ℝ⁺crp 12971 ...cfz 13481 seqcseq 13963 abscabs 15178 ⇝ cli 15425 Σcsu 15629

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 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7722 ax-inf2 9633 ax-cnex 11163 ax-resscn 11164 ax-1cn 11165 ax-icn 11166 ax-addcl 11167 ax-addrcl 11168 ax-mulcl 11169 ax-mulrcl 11170 ax-mulcom 11171 ax-addass 11172 ax-mulass 11173 ax-distr 11174 ax-i2m1 11175 ax-1ne0 11176 ax-1rid 11177 ax-rnegex 11178 ax-rrecex 11179 ax-cnre 11180 ax-pre-lttri 11181 ax-pre-lttrn 11182 ax-pre-ltadd 11183 ax-pre-mulgt0 11184 ax-pre-sup 11185

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 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6298 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6493 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-isom 6550 df-riota 7362 df-ov 7409 df-oprab 7410 df-mpo 7411 df-om 7853 df-1st 7972 df-2nd 7973 df-frecs 8263 df-wrecs 8294 df-recs 8368 df-rdg 8407 df-1o 8463 df-er 8700 df-pm 8820 df-en 8937 df-dom 8938 df-sdom 8939 df-fin 8940 df-sup 9434 df-inf 9435 df-oi 9502 df-card 9931 df-pnf 11247 df-mnf 11248 df-xr 11249 df-ltxr 11250 df-le 11251 df-sub 11443 df-neg 11444 df-div 11869 df-nn 12210 df-2 12272 df-3 12273 df-n0 12470 df-z 12556 df-uz 12820 df-rp 12972 df-ico 13327 df-fz 13482 df-fzo 13625 df-fl 13754 df-seq 13964 df-exp 14025 df-hash 14288 df-cj 15043 df-re 15044 df-im 15045 df-sqrt 15179 df-abs 15180 df-limsup 15412 df-clim 15429 df-rlim 15430 df-sum 15630

This theorem is referenced by: abscvgcvg 15762 geomulcvg 15819 cvgrat 15826 radcnvlem1 25917 radcnvlem2 25918 dvradcnv 25925 abelthlem5 25939 abelthlem7 25942 logtayllem 26159 binomcxplemnn0 43094

W3C validator