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 15760

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 2835	. . . . 5 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
4		eluzel2 12823	. . . . 5 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℤ)
5	3, 4	syl 17	. . . 4 ⊢ (𝜑 → 𝑀 ∈ ℤ)
6		cvgcmpce.4	. . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) ∈ ℂ)
7	1, 5, 6	serf 13992	. . 3 ⊢ (𝜑 → seq𝑀( + , 𝐺):𝑍⟶ℂ)
8	7	ffvelcdmda 7076	. 2 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ)
9		fveq2 6881	. . . . . . . . 9 ⊢ (𝑚 = 𝑘 → (𝐹‘𝑚) = (𝐹‘𝑘))
10	9	oveq2d 7417	. . . . . . . 8 ⊢ (𝑚 = 𝑘 → (𝐶 · (𝐹‘𝑚)) = (𝐶 · (𝐹‘𝑘)))
11		eqid 2724	. . . . . . . 8 ⊢ (𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚))) = (𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))
12		ovex 7434	. . . . . . . 8 ⊢ (𝐶 · (𝐹‘𝑘)) ∈ V
13	10, 11, 12	fvmpt 6988	. . . . . . 7 ⊢ (𝑘 ∈ 𝑍 → ((𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))‘𝑘) = (𝐶 · (𝐹‘𝑘)))
14	13	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))‘𝑘) = (𝐶 · (𝐹‘𝑘)))
15		cvgcmpce.6	. . . . . . . 8 ⊢ (𝜑 → 𝐶 ∈ ℝ)
16	15	adantr 480	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 𝐶 ∈ ℝ)
17		cvgcmpce.3	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ)
18	16, 17	remulcld 11240	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐶 · (𝐹‘𝑘)) ∈ ℝ)
19	14, 18	eqeltrd 2825	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))‘𝑘) ∈ ℝ)
20		2fveq3 6886	. . . . . . . 8 ⊢ (𝑚 = 𝑘 → (abs‘(𝐺‘𝑚)) = (abs‘(𝐺‘𝑘)))
21		eqid 2724	. . . . . . . 8 ⊢ (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))) = (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))
22		fvex 6894	. . . . . . . 8 ⊢ (abs‘(𝐺‘𝑘)) ∈ V
23	20, 21, 22	fvmpt 6988	. . . . . . 7 ⊢ (𝑘 ∈ 𝑍 → ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘) = (abs‘(𝐺‘𝑘)))
24	23	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘) = (abs‘(𝐺‘𝑘)))
25	6	abscld 15379	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (abs‘(𝐺‘𝑘)) ∈ ℝ)
26	24, 25	eqeltrd 2825	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘) ∈ ℝ)
27	15	recnd 11238	. . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ)
28		cvgcmpce.5	. . . . . . . 8 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ )
29		climdm 15494	. . . . . . . 8 ⊢ (seq𝑀( + , 𝐹) ∈ dom ⇝ ↔ seq𝑀( + , 𝐹) ⇝ ( ⇝ ‘seq𝑀( + , 𝐹)))
30	28, 29	sylib 217	. . . . . . 7 ⊢ (𝜑 → seq𝑀( + , 𝐹) ⇝ ( ⇝ ‘seq𝑀( + , 𝐹)))
31	17	recnd 11238	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ)
32	1, 5, 27, 30, 31, 14	isermulc2 15600	. . . . . 6 ⊢ (𝜑 → seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))) ⇝ (𝐶 · ( ⇝ ‘seq𝑀( + , 𝐹))))
33		climrel 15432	. . . . . . 7 ⊢ Rel ⇝
34	33	releldmi 5937	. . . . . 6 ⊢ (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))) ⇝ (𝐶 · ( ⇝ ‘seq𝑀( + , 𝐹))) → seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))) ∈ dom ⇝ )
35	32, 34	syl 17	. . . . 5 ⊢ (𝜑 → seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))) ∈ dom ⇝ )
36	1	uztrn2 12837	. . . . . . 7 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 𝑘 ∈ 𝑍)
37	2, 36	sylan 579	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 𝑘 ∈ 𝑍)
38	6	absge0d 15387	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ (abs‘(𝐺‘𝑘)))
39	38, 24	breqtrrd 5166	. . . . . 6 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → 0 ≤ ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘))
40	37, 39	syldan 590	. . . . 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 5170	. . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘) ≤ ((𝑚 ∈ 𝑍 ↦ (𝐶 · (𝐹‘𝑚)))‘𝑘))
45	1, 2, 19, 26, 35, 40, 44	cvgcmp 15758	. . . 4 ⊢ (𝜑 → seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))) ∈ dom ⇝ )
46	1	climcau 15613	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))) ∈ dom ⇝ ) → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥)
47	5, 45, 46	syl2anc 583	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥)
48	1, 5, 26	serfre 13993	. . . . . . . . . . . . 13 ⊢ (𝜑 → seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))):𝑍⟶ℝ)
49	48	ad2antrr 723	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))):𝑍⟶ℝ)
50	1	uztrn2 12837	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → 𝑛 ∈ 𝑍)
51	50	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑛 ∈ 𝑍)
52	49, 51	ffvelcdmd 7077	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) ∈ ℝ)
53		simprl 768	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑗 ∈ 𝑍)
54	49, 53	ffvelcdmd 7077	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗) ∈ ℝ)
55	52, 54	resubcld 11638	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) ∈ ℝ)
56		0red 11213	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 0 ∈ ℝ)
57	7	ad2antrr 723	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → seq𝑀( + , 𝐺):𝑍⟶ℂ)
58	57, 51	ffvelcdmd 7077	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ)
59	57, 53	ffvelcdmd 7077	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (seq𝑀( + , 𝐺)‘𝑗) ∈ ℂ)
60	58, 59	subcld 11567	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗)) ∈ ℂ)
61	60	abscld 15379	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) ∈ ℝ)
62	60	absge0d 15387	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 0 ≤ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))))
63		fzfid 13934	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝑀...𝑛) ∈ Fin)
64		difss 4123	. . . . . . . . . . . . . 14 ⊢ ((𝑀...𝑛) ∖ (𝑀...𝑗)) ⊆ (𝑀...𝑛)
65		ssfi 9168	. . . . . . . . . . . . . 14 ⊢ (((𝑀...𝑛) ∈ Fin ∧ ((𝑀...𝑛) ∖ (𝑀...𝑗)) ⊆ (𝑀...𝑛)) → ((𝑀...𝑛) ∖ (𝑀...𝑗)) ∈ Fin)
66	63, 64, 65	sylancl 585	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝑀...𝑛) ∖ (𝑀...𝑗)) ∈ Fin)
67		eldifi 4118	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗)) → 𝑘 ∈ (𝑀...𝑛))
68		simpll 764	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝜑)
69		elfzuz 13493	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ (ℤ_≥‘𝑀))
70	69, 1	eleqtrrdi 2836	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ 𝑍)
71	68, 70, 6	syl2an 595	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) ∈ ℂ)
72	67, 71	sylan2 592	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))) → (𝐺‘𝑘) ∈ ℂ)
73	66, 72	fsumabs 15743	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (abs‘Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(𝐺‘𝑘)) ≤ Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(abs‘(𝐺‘𝑘)))
74		eqidd 2725	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) = (𝐺‘𝑘))
75	51, 1	eleqtrdi 2835	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑛 ∈ (ℤ_≥‘𝑀))
76	74, 75, 71	fsumser 15672	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑛)(𝐺‘𝑘) = (seq𝑀( + , 𝐺)‘𝑛))
77		eqidd 2725	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐺‘𝑘) = (𝐺‘𝑘))
78	53, 1	eleqtrdi 2835	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑗 ∈ (ℤ_≥‘𝑀))
79		elfzuz 13493	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (𝑀...𝑗) → 𝑘 ∈ (ℤ_≥‘𝑀))
80	79, 1	eleqtrrdi 2836	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (𝑀...𝑗) → 𝑘 ∈ 𝑍)
81	68, 80, 6	syl2an 595	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑗)) → (𝐺‘𝑘) ∈ ℂ)
82	77, 78, 81	fsumser 15672	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑗)(𝐺‘𝑘) = (seq𝑀( + , 𝐺)‘𝑗))
83	76, 82	oveq12d 7419	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (Σ𝑘 ∈ (𝑀...𝑛)(𝐺‘𝑘) − Σ𝑘 ∈ (𝑀...𝑗)(𝐺‘𝑘)) = ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗)))
84		fzfid 13934	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝑀...𝑗) ∈ Fin)
85	84, 81	fsumcl 15675	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑗)(𝐺‘𝑘) ∈ ℂ)
86	66, 72	fsumcl 15675	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(𝐺‘𝑘) ∈ ℂ)
87		disjdif 4463	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀...𝑗) ∩ ((𝑀...𝑛) ∖ (𝑀...𝑗))) = ∅
88	87	a1i 11	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝑀...𝑗) ∩ ((𝑀...𝑛) ∖ (𝑀...𝑗))) = ∅)
89		undif2 4468	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑀...𝑗) ∪ ((𝑀...𝑛) ∖ (𝑀...𝑗))) = ((𝑀...𝑗) ∪ (𝑀...𝑛))
90		fzss2 13537	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ (ℤ_≥‘𝑗) → (𝑀...𝑗) ⊆ (𝑀...𝑛))
91	90	ad2antll 726	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝑀...𝑗) ⊆ (𝑀...𝑛))
92		ssequn1 4172	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝑀...𝑗) ⊆ (𝑀...𝑛) ↔ ((𝑀...𝑗) ∪ (𝑀...𝑛)) = (𝑀...𝑛))
93	91, 92	sylib 217	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((𝑀...𝑗) ∪ (𝑀...𝑛)) = (𝑀...𝑛))
94	89, 93	eqtr2id 2777	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (𝑀...𝑛) = ((𝑀...𝑗) ∪ ((𝑀...𝑛) ∖ (𝑀...𝑗))))
95	88, 94, 63, 71	fsumsplit 15683	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑛)(𝐺‘𝑘) = (Σ𝑘 ∈ (𝑀...𝑗)(𝐺‘𝑘) + Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(𝐺‘𝑘)))
96	85, 86, 95	mvrladdd 11623	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (Σ𝑘 ∈ (𝑀...𝑛)(𝐺‘𝑘) − Σ𝑘 ∈ (𝑀...𝑗)(𝐺‘𝑘)) = Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(𝐺‘𝑘))
97	83, 96	eqtr3d 2766	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗)) = Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(𝐺‘𝑘))
98	97	fveq2d 6885	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) = (abs‘Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(𝐺‘𝑘)))
99	70	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑛)) → 𝑘 ∈ 𝑍)
100	99, 23	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑛)) → ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘) = (abs‘(𝐺‘𝑘)))
101		abscl 15221	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐺‘𝑘) ∈ ℂ → (abs‘(𝐺‘𝑘)) ∈ ℝ)
102	101	recnd 11238	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺‘𝑘) ∈ ℂ → (abs‘(𝐺‘𝑘)) ∈ ℂ)
103	71, 102	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (abs‘(𝐺‘𝑘)) ∈ ℂ)
104	100, 75, 103	fsumser 15672	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑛)(abs‘(𝐺‘𝑘)) = (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛))
105	80	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑗)) → 𝑘 ∈ 𝑍)
106	105, 23	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑗)) → ((𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚)))‘𝑘) = (abs‘(𝐺‘𝑘)))
107	81, 102	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ (𝑀...𝑗)) → (abs‘(𝐺‘𝑘)) ∈ ℂ)
108	106, 78, 107	fsumser 15672	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑗)(abs‘(𝐺‘𝑘)) = (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))
109	104, 108	oveq12d 7419	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (Σ𝑘 ∈ (𝑀...𝑛)(abs‘(𝐺‘𝑘)) − Σ𝑘 ∈ (𝑀...𝑗)(abs‘(𝐺‘𝑘))) = ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)))
110	84, 107	fsumcl 15675	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑗)(abs‘(𝐺‘𝑘)) ∈ ℂ)
111	72, 102	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) ∧ 𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))) → (abs‘(𝐺‘𝑘)) ∈ ℂ)
112	66, 111	fsumcl 15675	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(abs‘(𝐺‘𝑘)) ∈ ℂ)
113	88, 94, 63, 103	fsumsplit 15683	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → Σ𝑘 ∈ (𝑀...𝑛)(abs‘(𝐺‘𝑘)) = (Σ𝑘 ∈ (𝑀...𝑗)(abs‘(𝐺‘𝑘)) + Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(abs‘(𝐺‘𝑘))))
114	110, 112, 113	mvrladdd 11623	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (Σ𝑘 ∈ (𝑀...𝑛)(abs‘(𝐺‘𝑘)) − Σ𝑘 ∈ (𝑀...𝑗)(abs‘(𝐺‘𝑘))) = Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(abs‘(𝐺‘𝑘)))
115	109, 114	eqtr3d 2766	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) = Σ𝑘 ∈ ((𝑀...𝑛) ∖ (𝑀...𝑗))(abs‘(𝐺‘𝑘)))
116	73, 98, 115	3brtr4d 5170	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) ≤ ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)))
117	56, 61, 55, 62, 116	letrd 11367	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 0 ≤ ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)))
118	55, 117	absidd 15365	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) = ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)))
119	118	breq1d 5148	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → ((abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥 ↔ ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) < 𝑥))
120		rpre 12978	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ℝ⁺ → 𝑥 ∈ ℝ)
121	120	ad2antlr 724	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → 𝑥 ∈ ℝ)
122		lelttr 11300	. . . . . . . . . 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 1368	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑗 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑗))) → (((abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) ≤ ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) ∧ ((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗)) < 𝑥) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥))
124	116, 123	mpand 692	. . . . . . . 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 467	. . . . . 6 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ_≥‘𝑗)) → ((abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥 → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥))
127	126	ralimdva 3159	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑗 ∈ 𝑍) → (∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥 → ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥))
128	127	reximdva 3160	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥 → ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥))
129	128	ralimdva 3159	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑛) − (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ (abs‘(𝐺‘𝑚))))‘𝑗))) < 𝑥 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥))
130	47, 129	mpd 15	. 2 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑗)(abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑗))) < 𝑥)
131		seqex 13964	. . 3 ⊢ seq𝑀( + , 𝐺) ∈ V
132	131	a1i 11	. 2 ⊢ (𝜑 → seq𝑀( + , 𝐺) ∈ V)
133	1, 8, 130, 132	caucvg 15621	1 ⊢ (𝜑 → seq𝑀( + , 𝐺) ∈ dom ⇝ )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1533 ∈ wcel 2098 ∀wral 3053 ∃wrex 3062 Vcvv 3466 ∖ cdif 3937 ∪ cun 3938 ∩ cin 3939 ⊆ wss 3940 ∅c0 4314 class class class wbr 5138 ↦ cmpt 5221 dom cdm 5666 ⟶wf 6529 ‘cfv 6533 (class class class)co 7401 Fincfn 8934 ℂcc 11103 ℝcr 11104 0cc0 11105 + caddc 11108 · cmul 11110 < clt 11244 ≤ cle 11245 − cmin 11440 ℤcz 12554 ℤ_≥cuz 12818 ℝ⁺crp 12970 ...cfz 13480 seqcseq 13962 abscabs 15177 ⇝ cli 15424 Σcsu 15628

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2163 ax-ext 2695 ax-rep 5275 ax-sep 5289 ax-nul 5296 ax-pow 5353 ax-pr 5417 ax-un 7718 ax-inf2 9631 ax-cnex 11161 ax-resscn 11162 ax-1cn 11163 ax-icn 11164 ax-addcl 11165 ax-addrcl 11166 ax-mulcl 11167 ax-mulrcl 11168 ax-mulcom 11169 ax-addass 11170 ax-mulass 11171 ax-distr 11172 ax-i2m1 11173 ax-1ne0 11174 ax-1rid 11175 ax-rnegex 11176 ax-rrecex 11177 ax-cnre 11178 ax-pre-lttri 11179 ax-pre-lttrn 11180 ax-pre-ltadd 11181 ax-pre-mulgt0 11182 ax-pre-sup 11183

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2526 df-eu 2555 df-clab 2702 df-cleq 2716 df-clel 2802 df-nfc 2877 df-ne 2933 df-nel 3039 df-ral 3054 df-rex 3063 df-rmo 3368 df-reu 3369 df-rab 3425 df-v 3468 df-sbc 3770 df-csb 3886 df-dif 3943 df-un 3945 df-in 3947 df-ss 3957 df-pss 3959 df-nul 4315 df-if 4521 df-pw 4596 df-sn 4621 df-pr 4623 df-op 4627 df-uni 4900 df-int 4941 df-iun 4989 df-br 5139 df-opab 5201 df-mpt 5222 df-tr 5256 df-id 5564 df-eprel 5570 df-po 5578 df-so 5579 df-fr 5621 df-se 5622 df-we 5623 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6290 df-ord 6357 df-on 6358 df-lim 6359 df-suc 6360 df-iota 6485 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-isom 6542 df-riota 7357 df-ov 7404 df-oprab 7405 df-mpo 7406 df-om 7849 df-1st 7968 df-2nd 7969 df-frecs 8261 df-wrecs 8292 df-recs 8366 df-rdg 8405 df-1o 8461 df-er 8698 df-pm 8818 df-en 8935 df-dom 8936 df-sdom 8937 df-fin 8938 df-sup 9432 df-inf 9433 df-oi 9500 df-card 9929 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-n0 12469 df-z 12555 df-uz 12819 df-rp 12971 df-ico 13326 df-fz 13481 df-fzo 13624 df-fl 13753 df-seq 13963 df-exp 14024 df-hash 14287 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

This theorem is referenced by: abscvgcvg 15761 geomulcvg 15818 cvgrat 15825 radcnvlem1 26254 radcnvlem2 26255 dvradcnv 26262 abelthlem5 26277 abelthlem7 26280 logtayllem 26497 binomcxplemnn0 43563

W3C validator