cvgcmp - Metamath Proof Explorer

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

Theorem cvgcmp 15802

Description: A comparison test for convergence of a real infinite series. Exercise 3 of [Gleason] p. 182. (Contributed by NM, 1-May-2005.) (Revised by Mario Carneiro, 24-Mar-2014.)

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

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

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

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

Step	Hyp	Ref	Expression
1		cvgcmp.1	. 2 ⊢ 𝑍 = (ℤ_≥‘𝑀)
2		seqex 14008	. . 3 ⊢ seq𝑀( + , 𝐺) ∈ V
3	2	a1i 11	. 2 ⊢ (𝜑 → seq𝑀( + , 𝐺) ∈ V)
4		cvgcmp.2	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ 𝑍)
5	4, 1	eleqtrdi 2839	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
6		eluzel2 12865	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℤ)
7	5, 6	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
8		cvgcmp.5	. . . . . 6 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ )
9	1	climcau 15657	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ seq𝑀( + , 𝐹) ∈ dom ⇝ ) → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥)
10	7, 8, 9	syl2anc 582	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥)
11		cvgcmp.3	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ)
12	1, 7, 11	serfre 14036	. . . . . . . . . 10 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℝ)
13	12	ffvelcdmda 7099	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑛) ∈ ℝ)
14	13	recnd 11280	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ)
15	14	ralrimiva 3143	. . . . . . 7 ⊢ (𝜑 → ∀𝑛 ∈ 𝑍 (seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ)
16	1	r19.29uz 15337	. . . . . . . 8 ⊢ ((∀𝑛 ∈ 𝑍 (seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) → ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥))
17	16	ex 411	. . . . . . 7 ⊢ (∀𝑛 ∈ 𝑍 (seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ → (∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥 → ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥)))
18	15, 17	syl 17	. . . . . 6 ⊢ (𝜑 → (∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥 → ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥)))
19	18	ralimdv 3166	. . . . 5 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥 → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥)))
20	10, 19	mpd 15	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥))
21	1	uztrn2 12879	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑛 ∈ 𝑍)
22	4, 21	sylan 578	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑛 ∈ 𝑍)
23		cvgcmp.4	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) ∈ ℝ)
24	1, 7, 23	serfre 14036	. . . . . . . . . . . 12 ⊢ (𝜑 → seq𝑀( + , 𝐺):𝑍⟶ℝ)
25	24	ffvelcdmda 7099	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ)
26	25	recnd 11280	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ)
27	22, 26	syldan 589	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ)
28	27	ralrimiva 3143	. . . . . . . 8 ⊢ (𝜑 → ∀𝑛 ∈ (ℤ_≥‘𝑁)(seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ)
29	28	adantr 479	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → ∀𝑛 ∈ (ℤ_≥‘𝑁)(seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ)
30		simpll 765	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝜑)
31	30, 12	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → seq𝑀( + , 𝐹):𝑍⟶ℝ)
32	30, 4	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑁 ∈ 𝑍)
33		simprl 769	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑚 ∈ (ℤ_≥‘𝑁))
34	1	uztrn2 12879	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑚 ∈ 𝑍)
35	32, 33, 34	syl2anc 582	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑚 ∈ 𝑍)
36	31, 35	ffvelcdmd 7100	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐹)‘𝑚) ∈ ℝ)
37		eqid 2728	. . . . . . . . . . . . . . . . . 18 ⊢ (ℤ_≥‘𝑁) = (ℤ_≥‘𝑁)
38	37	uztrn2 12879	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚)) → 𝑛 ∈ (ℤ_≥‘𝑁))
39	38	adantl 480	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑛 ∈ (ℤ_≥‘𝑁))
40	32, 39, 21	syl2anc 582	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑛 ∈ 𝑍)
41	30, 40, 13	syl2anc 582	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐹)‘𝑛) ∈ ℝ)
42	30, 40, 25	syl2anc 582	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ)
43	30, 24	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → seq𝑀( + , 𝐺):𝑍⟶ℝ)
44	43, 35	ffvelcdmd 7100	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐺)‘𝑚) ∈ ℝ)
45	42, 44	resubcld 11680	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) ∈ ℝ)
46	35, 1	eleqtrdi 2839	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑚 ∈ (ℤ_≥‘𝑀))
47		simprr 771	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑛 ∈ (ℤ_≥‘𝑚))
48		elfzuz 13537	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ (ℤ_≥‘𝑀))
49	48, 1	eleqtrrdi 2840	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ 𝑍)
50		fveq2 6902	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑚 = 𝑘 → (𝐹‘𝑚) = (𝐹‘𝑘))
51		fveq2 6902	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑚 = 𝑘 → (𝐺‘𝑚) = (𝐺‘𝑘))
52	50, 51	oveq12d 7444	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑚 = 𝑘 → ((𝐹‘𝑚) − (𝐺‘𝑚)) = ((𝐹‘𝑘) − (𝐺‘𝑘)))
53		eqid 2728	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚))) = (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))
54		ovex 7459	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹‘𝑘) − (𝐺‘𝑘)) ∈ V
55	52, 53, 54	fvmpt 7010	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑘 ∈ 𝑍 → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) = ((𝐹‘𝑘) − (𝐺‘𝑘)))
56	55	adantl 480	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) = ((𝐹‘𝑘) − (𝐺‘𝑘)))
57	11, 23	resubcld 11680	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝐹‘𝑘) − (𝐺‘𝑘)) ∈ ℝ)
58	56, 57	eqeltrd 2829	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) ∈ ℝ)
59	30, 49, 58	syl2an 594	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑛)) → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) ∈ ℝ)
60		elfzuz 13537	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ ((𝑚 + 1)...𝑛) → 𝑘 ∈ (ℤ_≥‘(𝑚 + 1)))
61		peano2uz 12923	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑚 ∈ (ℤ_≥‘𝑁) → (𝑚 + 1) ∈ (ℤ_≥‘𝑁))
62	33, 61	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (𝑚 + 1) ∈ (ℤ_≥‘𝑁))
63	37	uztrn2 12879	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑚 + 1) ∈ (ℤ_≥‘𝑁) ∧ 𝑘 ∈ (ℤ_≥‘(𝑚 + 1))) → 𝑘 ∈ (ℤ_≥‘𝑁))
64	62, 63	sylan 578	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (ℤ_≥‘(𝑚 + 1))) → 𝑘 ∈ (ℤ_≥‘𝑁))
65		cvgcmp.7	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → (𝐺‘𝑘) ≤ (𝐹‘𝑘))
66	1	uztrn2 12879	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 𝑘 ∈ 𝑍)
67	4, 66	sylan 578	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 𝑘 ∈ 𝑍)
68	11, 23	subge0d 11842	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (0 ≤ ((𝐹‘𝑘) − (𝐺‘𝑘)) ↔ (𝐺‘𝑘) ≤ (𝐹‘𝑘)))
69	67, 68	syldan 589	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → (0 ≤ ((𝐹‘𝑘) − (𝐺‘𝑘)) ↔ (𝐺‘𝑘) ≤ (𝐹‘𝑘)))
70	65, 69	mpbird 256	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 0 ≤ ((𝐹‘𝑘) − (𝐺‘𝑘)))
71	67, 55	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) = ((𝐹‘𝑘) − (𝐺‘𝑘)))
72	70, 71	breqtrrd 5180	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 0 ≤ ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘))
73	30, 64, 72	syl2an2r 683	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (ℤ_≥‘(𝑚 + 1))) → 0 ≤ ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘))
74	60, 73	sylan2 591	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ ((𝑚 + 1)...𝑛)) → 0 ≤ ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘))
75	46, 47, 59, 74	sermono 14039	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚))))‘𝑚) ≤ (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚))))‘𝑛))
76		elfzuz 13537	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ (𝑀...𝑚) → 𝑘 ∈ (ℤ_≥‘𝑀))
77	76, 1	eleqtrrdi 2840	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (𝑀...𝑚) → 𝑘 ∈ 𝑍)
78	11	recnd 11280	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ)
79	30, 77, 78	syl2an 594	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑚)) → (𝐹‘𝑘) ∈ ℂ)
80	23	recnd 11280	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) ∈ ℂ)
81	30, 77, 80	syl2an 594	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑚)) → (𝐺‘𝑘) ∈ ℂ)
82	30, 77, 56	syl2an 594	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑚)) → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) = ((𝐹‘𝑘) − (𝐺‘𝑘)))
83	46, 79, 81, 82	sersub 14050	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚))))‘𝑚) = ((seq𝑀( + , 𝐹)‘𝑚) − (seq𝑀( + , 𝐺)‘𝑚)))
84	40, 1	eleqtrdi 2839	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑛 ∈ (ℤ_≥‘𝑀))
85	30, 49, 78	syl2an 594	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐹‘𝑘) ∈ ℂ)
86	30, 49, 80	syl2an 594	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) ∈ ℂ)
87	30, 49, 56	syl2an 594	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑛)) → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) = ((𝐹‘𝑘) − (𝐺‘𝑘)))
88	84, 85, 86, 87	sersub 14050	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚))))‘𝑛) = ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)))
89	75, 83, 88	3brtr3d 5183	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((seq𝑀( + , 𝐹)‘𝑚) − (seq𝑀( + , 𝐺)‘𝑚)) ≤ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)))
90	41, 42	resubcld 11680	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)) ∈ ℝ)
91	36, 44, 90	lesubaddd 11849	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (((seq𝑀( + , 𝐹)‘𝑚) − (seq𝑀( + , 𝐺)‘𝑚)) ≤ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)) ↔ (seq𝑀( + , 𝐹)‘𝑚) ≤ (((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)) + (seq𝑀( + , 𝐺)‘𝑚))))
92	89, 91	mpbid 231	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐹)‘𝑚) ≤ (((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)) + (seq𝑀( + , 𝐺)‘𝑚)))
93	41	recnd 11280	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ)
94	42	recnd 11280	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ)
95	44	recnd 11280	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐺)‘𝑚) ∈ ℂ)
96	93, 94, 95	subsubd 11637	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((seq𝑀( + , 𝐹)‘𝑛) − ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) = (((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)) + (seq𝑀( + , 𝐺)‘𝑚)))
97	92, 96	breqtrrd 5180	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐹)‘𝑚) ≤ ((seq𝑀( + , 𝐹)‘𝑛) − ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))))
98	36, 41, 45, 97	lesubd 11856	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) ≤ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)))
99	41, 36	resubcld 11680	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) ∈ ℝ)
100		rpre 13022	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ℝ⁺ → 𝑥 ∈ ℝ)
101	100	ad2antlr 725	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑥 ∈ ℝ)
102		lelttr 11342	. . . . . . . . . . . . . 14 ⊢ ((((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) ∈ ℝ ∧ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) ≤ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) ∧ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) < 𝑥) → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) < 𝑥))
103	45, 99, 101, 102	syl3anc 1368	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) ≤ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) ∧ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) < 𝑥) → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) < 𝑥))
104	98, 103	mpand 693	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) < 𝑥 → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) < 𝑥))
105	30, 49, 11	syl2an 594	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐹‘𝑘) ∈ ℝ)
106	60, 64	sylan2 591	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ ((𝑚 + 1)...𝑛)) → 𝑘 ∈ (ℤ_≥‘𝑁))
107		0red 11255	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 0 ∈ ℝ)
108	67, 23	syldan 589	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → (𝐺‘𝑘) ∈ ℝ)
109	67, 11	syldan 589	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → (𝐹‘𝑘) ∈ ℝ)
110		cvgcmp.6	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 0 ≤ (𝐺‘𝑘))
111	107, 108, 109, 110, 65	letrd 11409	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 0 ≤ (𝐹‘𝑘))
112	30, 106, 111	syl2an2r 683	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ ((𝑚 + 1)...𝑛)) → 0 ≤ (𝐹‘𝑘))
113	46, 47, 105, 112	sermono 14039	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐹)‘𝑚) ≤ (seq𝑀( + , 𝐹)‘𝑛))
114	36, 41, 113	abssubge0d 15418	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) = ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)))
115	114	breq1d 5162	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥 ↔ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) < 𝑥))
116	30, 49, 23	syl2an 594	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) ∈ ℝ)
117	30, 64, 110	syl2an2r 683	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (ℤ_≥‘(𝑚 + 1))) → 0 ≤ (𝐺‘𝑘))
118	60, 117	sylan2 591	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ ((𝑚 + 1)...𝑛)) → 0 ≤ (𝐺‘𝑘))
119	46, 47, 116, 118	sermono 14039	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐺)‘𝑚) ≤ (seq𝑀( + , 𝐺)‘𝑛))
120	44, 42, 119	abssubge0d 15418	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) = ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)))
121	120	breq1d 5162	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥 ↔ ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) < 𝑥))
122	104, 115, 121	3imtr4d 293	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥 → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
123	122	anassrs 466	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) ∧ 𝑛 ∈ (ℤ_≥‘𝑚)) → ((abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥 → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
124	123	adantld 489	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) ∧ 𝑛 ∈ (ℤ_≥‘𝑚)) → (((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
125	124	ralimdva 3164	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → (∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) → ∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
126	125	reximdva 3165	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) → ∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
127	37	r19.29uz 15337	. . . . . . 7 ⊢ ((∀𝑛 ∈ (ℤ_≥‘𝑁)(seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ ∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → ∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
128	29, 126, 127	syl6an 682	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) → ∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
129	128	ralimdva 3164	. . . . 5 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
130	1, 37	cau4 15343	. . . . . 6 ⊢ (𝑁 ∈ 𝑍 → (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥)))
131	4, 130	syl 17	. . . . 5 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥)))
132	1, 37	cau4 15343	. . . . . 6 ⊢ (𝑁 ∈ 𝑍 → (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
133	4, 132	syl 17	. . . . 5 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) ↔ ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
134	129, 131, 133	3imtr4d 293	. . . 4 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
135	20, 134	mpd 15	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
136	1	uztrn2 12879	. . . . . . . 8 ⊢ ((𝑚 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑚)) → 𝑛 ∈ 𝑍)
137		simpr 483	. . . . . . . . 9 ⊢ (((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)
138	25	biantrurd 531	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → ((abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥 ↔ ((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
139	137, 138	imbitrid 243	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → ((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
140	136, 139	sylan2 591	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → ((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
141	140	anassrs 466	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ_≥‘𝑚)) → (((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → ((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
142	141	ralimdva 3164	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
143	142	reximdva 3165	. . . 4 ⊢ (𝜑 → (∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
144	143	ralimdv 3166	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
145	135, 144	mpd 15	. 2 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
146	1, 3, 145	caurcvg2 15664	1 ⊢ (𝜑 → seq𝑀( + , 𝐺) ∈ dom ⇝ )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ∀wral 3058 ∃wrex 3067 Vcvv 3473 class class class wbr 5152 ↦ cmpt 5235 dom cdm 5682 ⟶wf 6549 ‘cfv 6553 (class class class)co 7426 ℂcc 11144 ℝcr 11145 0cc0 11146 1c1 11147 + caddc 11149 < clt 11286 ≤ cle 11287 − cmin 11482 ℤcz 12596 ℤ_≥cuz 12860 ℝ⁺crp 13014 ...cfz 13524 seqcseq 14006 abscabs 15221 ⇝ cli 15468

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 2166 ax-ext 2699 ax-rep 5289 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-inf2 9672 ax-cnex 11202 ax-resscn 11203 ax-1cn 11204 ax-icn 11205 ax-addcl 11206 ax-addrcl 11207 ax-mulcl 11208 ax-mulrcl 11209 ax-mulcom 11210 ax-addass 11211 ax-mulass 11212 ax-distr 11213 ax-i2m1 11214 ax-1ne0 11215 ax-1rid 11216 ax-rnegex 11217 ax-rrecex 11218 ax-cnre 11219 ax-pre-lttri 11220 ax-pre-lttrn 11221 ax-pre-ltadd 11222 ax-pre-mulgt0 11223 ax-pre-sup 11224

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-iun 5002 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-om 7877 df-1st 7999 df-2nd 8000 df-frecs 8293 df-wrecs 8324 df-recs 8398 df-rdg 8437 df-er 8731 df-pm 8854 df-en 8971 df-dom 8972 df-sdom 8973 df-sup 9473 df-inf 9474 df-pnf 11288 df-mnf 11289 df-xr 11290 df-ltxr 11291 df-le 11292 df-sub 11484 df-neg 11485 df-div 11910 df-nn 12251 df-2 12313 df-3 12314 df-n0 12511 df-z 12597 df-uz 12861 df-rp 13015 df-ico 13370 df-fz 13525 df-fzo 13668 df-fl 13797 df-seq 14007 df-exp 14067 df-cj 15086 df-re 15087 df-im 15088 df-sqrt 15222 df-abs 15223 df-limsup 15455 df-clim 15472 df-rlim 15473

This theorem is referenced by: cvgcmpce 15804 rpnnen2lem5 16202 aaliou3lem3 26299

W3C validator