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 15758

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 13964	. . 3 ⊢ seq𝑀( + , 𝐺) ∈ V
3	2	a1i 11	. 2 ⊢ (𝜑 → seq𝑀( + , 𝐺) ∈ V)
4		cvgcmp.2	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ 𝑍)
5	4, 1	eleqtrdi 2843	. . . . . . 7 ⊢ (𝜑 → 𝑁 ∈ (ℤ_≥‘𝑀))
6		eluzel2 12823	. . . . . . 7 ⊢ (𝑁 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℤ)
7	5, 6	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ ℤ)
8		cvgcmp.5	. . . . . 6 ⊢ (𝜑 → seq𝑀( + , 𝐹) ∈ dom ⇝ )
9	1	climcau 15613	. . . . . 6 ⊢ ((𝑀 ∈ ℤ ∧ seq𝑀( + , 𝐹) ∈ dom ⇝ ) → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥)
10	7, 8, 9	syl2anc 584	. . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥)
11		cvgcmp.3	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℝ)
12	1, 7, 11	serfre 13993	. . . . . . . . . 10 ⊢ (𝜑 → seq𝑀( + , 𝐹):𝑍⟶ℝ)
13	12	ffvelcdmda 7083	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑛) ∈ ℝ)
14	13	recnd 11238	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ)
15	14	ralrimiva 3146	. . . . . . 7 ⊢ (𝜑 → ∀𝑛 ∈ 𝑍 (seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ)
16	1	r19.29uz 15293	. . . . . . . 8 ⊢ ((∀𝑛 ∈ 𝑍 (seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) → ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥))
17	16	ex 413	. . . . . . 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 3169	. . . . 5 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥 → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥)))
20	10, 19	mpd 15	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥))
21	1	uztrn2 12837	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑛 ∈ 𝑍)
22	4, 21	sylan 580	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → 𝑛 ∈ 𝑍)
23		cvgcmp.4	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) ∈ ℝ)
24	1, 7, 23	serfre 13993	. . . . . . . . . . . 12 ⊢ (𝜑 → seq𝑀( + , 𝐺):𝑍⟶ℝ)
25	24	ffvelcdmda 7083	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ)
26	25	recnd 11238	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ)
27	22, 26	syldan 591	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑛 ∈ (ℤ_≥‘𝑁)) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ)
28	27	ralrimiva 3146	. . . . . . . 8 ⊢ (𝜑 → ∀𝑛 ∈ (ℤ_≥‘𝑁)(seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ)
29	28	adantr 481	. . . . . . 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 12837	. . . . . . . . . . . . . . . 16 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → 𝑚 ∈ 𝑍)
35	32, 33, 34	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑚 ∈ 𝑍)
36	31, 35	ffvelcdmd 7084	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐹)‘𝑚) ∈ ℝ)
37		eqid 2732	. . . . . . . . . . . . . . . . . 18 ⊢ (ℤ_≥‘𝑁) = (ℤ_≥‘𝑁)
38	37	uztrn2 12837	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚)) → 𝑛 ∈ (ℤ_≥‘𝑁))
39	38	adantl 482	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑛 ∈ (ℤ_≥‘𝑁))
40	32, 39, 21	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑛 ∈ 𝑍)
41	30, 40, 13	syl2anc 584	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐹)‘𝑛) ∈ ℝ)
42	30, 40, 25	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ)
43	30, 24	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → seq𝑀( + , 𝐺):𝑍⟶ℝ)
44	43, 35	ffvelcdmd 7084	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐺)‘𝑚) ∈ ℝ)
45	42, 44	resubcld 11638	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) ∈ ℝ)
46	35, 1	eleqtrdi 2843	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑚 ∈ (ℤ_≥‘𝑀))
47		simprr 771	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑛 ∈ (ℤ_≥‘𝑚))
48		elfzuz 13493	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ (ℤ_≥‘𝑀))
49	48, 1	eleqtrrdi 2844	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (𝑀...𝑛) → 𝑘 ∈ 𝑍)
50		fveq2 6888	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑚 = 𝑘 → (𝐹‘𝑚) = (𝐹‘𝑘))
51		fveq2 6888	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (𝑚 = 𝑘 → (𝐺‘𝑚) = (𝐺‘𝑘))
52	50, 51	oveq12d 7423	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑚 = 𝑘 → ((𝐹‘𝑚) − (𝐺‘𝑚)) = ((𝐹‘𝑘) − (𝐺‘𝑘)))
53		eqid 2732	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚))) = (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))
54		ovex 7438	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹‘𝑘) − (𝐺‘𝑘)) ∈ V
55	52, 53, 54	fvmpt 6995	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑘 ∈ 𝑍 → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) = ((𝐹‘𝑘) − (𝐺‘𝑘)))
56	55	adantl 482	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) = ((𝐹‘𝑘) − (𝐺‘𝑘)))
57	11, 23	resubcld 11638	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝐹‘𝑘) − (𝐺‘𝑘)) ∈ ℝ)
58	56, 57	eqeltrd 2833	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) ∈ ℝ)
59	30, 49, 58	syl2an 596	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑛)) → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) ∈ ℝ)
60		elfzuz 13493	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ ((𝑚 + 1)...𝑛) → 𝑘 ∈ (ℤ_≥‘(𝑚 + 1)))
61		peano2uz 12881	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (𝑚 ∈ (ℤ_≥‘𝑁) → (𝑚 + 1) ∈ (ℤ_≥‘𝑁))
62	33, 61	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (𝑚 + 1) ∈ (ℤ_≥‘𝑁))
63	37	uztrn2 12837	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝑚 + 1) ∈ (ℤ_≥‘𝑁) ∧ 𝑘 ∈ (ℤ_≥‘(𝑚 + 1))) → 𝑘 ∈ (ℤ_≥‘𝑁))
64	62, 63	sylan 580	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (ℤ_≥‘(𝑚 + 1))) → 𝑘 ∈ (ℤ_≥‘𝑁))
65		cvgcmp.7	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → (𝐺‘𝑘) ≤ (𝐹‘𝑘))
66	1	uztrn2 12837	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑁 ∈ 𝑍 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 𝑘 ∈ 𝑍)
67	4, 66	sylan 580	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 𝑘 ∈ 𝑍)
68	11, 23	subge0d 11800	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (0 ≤ ((𝐹‘𝑘) − (𝐺‘𝑘)) ↔ (𝐺‘𝑘) ≤ (𝐹‘𝑘)))
69	67, 68	syldan 591	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → (0 ≤ ((𝐹‘𝑘) − (𝐺‘𝑘)) ↔ (𝐺‘𝑘) ≤ (𝐹‘𝑘)))
70	65, 69	mpbird 256	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 0 ≤ ((𝐹‘𝑘) − (𝐺‘𝑘)))
71	67, 55	syl 17	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) = ((𝐹‘𝑘) − (𝐺‘𝑘)))
72	70, 71	breqtrrd 5175	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 0 ≤ ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘))
73	30, 64, 72	syl2an2r 683	. . . . . . . . . . . . . . . . . . 19 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (ℤ_≥‘(𝑚 + 1))) → 0 ≤ ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘))
74	60, 73	sylan2 593	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ ((𝑚 + 1)...𝑛)) → 0 ≤ ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘))
75	46, 47, 59, 74	sermono 13996	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚))))‘𝑚) ≤ (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚))))‘𝑛))
76		elfzuz 13493	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑘 ∈ (𝑀...𝑚) → 𝑘 ∈ (ℤ_≥‘𝑀))
77	76, 1	eleqtrrdi 2844	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (𝑀...𝑚) → 𝑘 ∈ 𝑍)
78	11	recnd 11238	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ)
79	30, 77, 78	syl2an 596	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑚)) → (𝐹‘𝑘) ∈ ℂ)
80	23	recnd 11238	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐺‘𝑘) ∈ ℂ)
81	30, 77, 80	syl2an 596	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑚)) → (𝐺‘𝑘) ∈ ℂ)
82	30, 77, 56	syl2an 596	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑚)) → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) = ((𝐹‘𝑘) − (𝐺‘𝑘)))
83	46, 79, 81, 82	sersub 14007	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚))))‘𝑚) = ((seq𝑀( + , 𝐹)‘𝑚) − (seq𝑀( + , 𝐺)‘𝑚)))
84	40, 1	eleqtrdi 2843	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑛 ∈ (ℤ_≥‘𝑀))
85	30, 49, 78	syl2an 596	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐹‘𝑘) ∈ ℂ)
86	30, 49, 80	syl2an 596	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) ∈ ℂ)
87	30, 49, 56	syl2an 596	. . . . . . . . . . . . . . . . . 18 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑛)) → ((𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚)))‘𝑘) = ((𝐹‘𝑘) − (𝐺‘𝑘)))
88	84, 85, 86, 87	sersub 14007	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , (𝑚 ∈ 𝑍 ↦ ((𝐹‘𝑚) − (𝐺‘𝑚))))‘𝑛) = ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)))
89	75, 83, 88	3brtr3d 5178	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((seq𝑀( + , 𝐹)‘𝑚) − (seq𝑀( + , 𝐺)‘𝑚)) ≤ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)))
90	41, 42	resubcld 11638	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)) ∈ ℝ)
91	36, 44, 90	lesubaddd 11807	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (((seq𝑀( + , 𝐹)‘𝑚) − (seq𝑀( + , 𝐺)‘𝑚)) ≤ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)) ↔ (seq𝑀( + , 𝐹)‘𝑚) ≤ (((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)) + (seq𝑀( + , 𝐺)‘𝑚))))
92	89, 91	mpbid 231	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐹)‘𝑚) ≤ (((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)) + (seq𝑀( + , 𝐺)‘𝑚)))
93	41	recnd 11238	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ)
94	42	recnd 11238	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ)
95	44	recnd 11238	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐺)‘𝑚) ∈ ℂ)
96	93, 94, 95	subsubd 11595	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((seq𝑀( + , 𝐹)‘𝑛) − ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) = (((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑛)) + (seq𝑀( + , 𝐺)‘𝑚)))
97	92, 96	breqtrrd 5175	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐹)‘𝑚) ≤ ((seq𝑀( + , 𝐹)‘𝑛) − ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))))
98	36, 41, 45, 97	lesubd 11814	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) ≤ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)))
99	41, 36	resubcld 11638	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) ∈ ℝ)
100		rpre 12978	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ℝ⁺ → 𝑥 ∈ ℝ)
101	100	ad2antlr 725	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → 𝑥 ∈ ℝ)
102		lelttr 11300	. . . . . . . . . . . . . 14 ⊢ ((((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) ∈ ℝ ∧ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) ∈ ℝ ∧ 𝑥 ∈ ℝ) → ((((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) ≤ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) ∧ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) < 𝑥) → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) < 𝑥))
103	45, 99, 101, 102	syl3anc 1371	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) ≤ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) ∧ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) < 𝑥) → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) < 𝑥))
104	98, 103	mpand 693	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) < 𝑥 → ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) < 𝑥))
105	30, 49, 11	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐹‘𝑘) ∈ ℝ)
106	60, 64	sylan2 593	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ ((𝑚 + 1)...𝑛)) → 𝑘 ∈ (ℤ_≥‘𝑁))
107		0red 11213	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 0 ∈ ℝ)
108	67, 23	syldan 591	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → (𝐺‘𝑘) ∈ ℝ)
109	67, 11	syldan 591	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → (𝐹‘𝑘) ∈ ℝ)
110		cvgcmp.6	. . . . . . . . . . . . . . . . 17 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 0 ≤ (𝐺‘𝑘))
111	107, 108, 109, 110, 65	letrd 11367	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝑘 ∈ (ℤ_≥‘𝑁)) → 0 ≤ (𝐹‘𝑘))
112	30, 106, 111	syl2an2r 683	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ ((𝑚 + 1)...𝑛)) → 0 ≤ (𝐹‘𝑘))
113	46, 47, 105, 112	sermono 13996	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐹)‘𝑚) ≤ (seq𝑀( + , 𝐹)‘𝑛))
114	36, 41, 113	abssubge0d 15374	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) = ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)))
115	114	breq1d 5157	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥 ↔ ((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚)) < 𝑥))
116	30, 49, 23	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (𝑀...𝑛)) → (𝐺‘𝑘) ∈ ℝ)
117	30, 64, 110	syl2an2r 683	. . . . . . . . . . . . . . . 16 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ (ℤ_≥‘(𝑚 + 1))) → 0 ≤ (𝐺‘𝑘))
118	60, 117	sylan2 593	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) ∧ 𝑘 ∈ ((𝑚 + 1)...𝑛)) → 0 ≤ (𝐺‘𝑘))
119	46, 47, 116, 118	sermono 13996	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (seq𝑀( + , 𝐺)‘𝑚) ≤ (seq𝑀( + , 𝐺)‘𝑛))
120	44, 42, 119	abssubge0d 15374	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) = ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)))
121	120	breq1d 5157	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥 ↔ ((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚)) < 𝑥))
122	104, 115, 121	3imtr4d 293	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ (𝑚 ∈ (ℤ_≥‘𝑁) ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → ((abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥 → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
123	122	anassrs 468	. . . . . . . . . 10 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) ∧ 𝑛 ∈ (ℤ_≥‘𝑚)) → ((abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥 → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
124	123	adantld 491	. . . . . . . . 9 ⊢ ((((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) ∧ 𝑛 ∈ (ℤ_≥‘𝑚)) → (((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
125	124	ralimdva 3167	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑥 ∈ ℝ⁺) ∧ 𝑚 ∈ (ℤ_≥‘𝑁)) → (∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) → ∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
126	125	reximdva 3168	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ⁺) → (∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) → ∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)(abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
127	37	r19.29uz 15293	. . . . . . 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 3167	. . . . 5 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐹)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐹)‘𝑛) − (seq𝑀( + , 𝐹)‘𝑚))) < 𝑥) → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ (ℤ_≥‘𝑁)∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
130	1, 37	cau4 15299	. . . . . 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 15299	. . . . . 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 12837	. . . . . . . 8 ⊢ ((𝑚 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑚)) → 𝑛 ∈ 𝑍)
137		simpr 485	. . . . . . . . 9 ⊢ (((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)
138	25	biantrurd 533	. . . . . . . . 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 593	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑚 ∈ 𝑍 ∧ 𝑛 ∈ (ℤ_≥‘𝑚))) → (((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → ((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
141	140	anassrs 468	. . . . . 6 ⊢ (((𝜑 ∧ 𝑚 ∈ 𝑍) ∧ 𝑛 ∈ (ℤ_≥‘𝑚)) → (((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → ((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
142	141	ralimdva 3167	. . . . 5 ⊢ ((𝜑 ∧ 𝑚 ∈ 𝑍) → (∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
143	142	reximdva 3168	. . . 4 ⊢ (𝜑 → (∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
144	143	ralimdv 3169	. . 3 ⊢ (𝜑 → (∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℂ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥) → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥)))
145	135, 144	mpd 15	. 2 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑚 ∈ 𝑍 ∀𝑛 ∈ (ℤ_≥‘𝑚)((seq𝑀( + , 𝐺)‘𝑛) ∈ ℝ ∧ (abs‘((seq𝑀( + , 𝐺)‘𝑛) − (seq𝑀( + , 𝐺)‘𝑚))) < 𝑥))
146	1, 3, 145	caurcvg2 15620	1 ⊢ (𝜑 → seq𝑀( + , 𝐺) ∈ dom ⇝ )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∃wrex 3070 Vcvv 3474 class class class wbr 5147 ↦ cmpt 5230 dom cdm 5675 ⟶wf 6536 ‘cfv 6540 (class class class)co 7405 ℂcc 11104 ℝcr 11105 0cc0 11106 1c1 11107 + caddc 11109 < clt 11244 ≤ cle 11245 − cmin 11440 ℤcz 12554 ℤ_≥cuz 12818 ℝ⁺crp 12970 ...cfz 13480 seqcseq 13962 abscabs 15177 ⇝ cli 15424

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-inf2 9632 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 ax-pre-sup 11184

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7361 df-ov 7408 df-oprab 7409 df-mpo 7410 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-er 8699 df-pm 8819 df-en 8936 df-dom 8937 df-sdom 8938 df-sup 9433 df-inf 9434 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-cj 15042 df-re 15043 df-im 15044 df-sqrt 15178 df-abs 15179 df-limsup 15411 df-clim 15428 df-rlim 15429

This theorem is referenced by: cvgcmpce 15760 rpnnen2lem5 16157 aaliou3lem3 25848

W3C validator