caucvg - Metamath Proof Explorer

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

Theorem caucvg 15621

Description: A Cauchy sequence of complex numbers converges to a complex number. Theorem 12-5.3 of [Gleason] p. 180 (sufficiency part). (Contributed by NM, 20-Dec-2006.) (Proof shortened by Mario Carneiro, 15-Feb-2014.) (Revised by Mario Carneiro, 8-May-2016.)

**Hypotheses**
Ref	Expression
caucvg.1	⊢ 𝑍 = (ℤ_≥‘𝑀)
caucvg.2	⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ)
caucvg.3	⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥)
caucvg.4	⊢ (𝜑 → 𝐹 ∈ 𝑉)

**Assertion**
Ref	Expression
caucvg	⊢ (𝜑 → 𝐹 ∈ dom ⇝ )

Distinct variable groups: 𝑗,𝑘,𝑥,𝐹 𝑗,𝑀,𝑘,𝑥 𝜑,𝑗,𝑘,𝑥 𝑗,𝑍,𝑘,𝑥 Allowed substitution hints: 𝑉(𝑥,𝑗,𝑘)

Proof of Theorem caucvg Dummy variable 𝑛 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6888	. . . . . 6 ⊢ (𝑘 = 𝑛 → (𝐹‘𝑘) = (𝐹‘𝑛))
2	1	cbvmptv 5260	. . . . 5 ⊢ (𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘)) = (𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))
3		caucvg.1	. . . . . . . . . 10 ⊢ 𝑍 = (ℤ_≥‘𝑀)
4		uzssz 12839	. . . . . . . . . 10 ⊢ (ℤ_≥‘𝑀) ⊆ ℤ
5	3, 4	eqsstri 4015	. . . . . . . . 9 ⊢ 𝑍 ⊆ ℤ
6		zssre 12561	. . . . . . . . 9 ⊢ ℤ ⊆ ℝ
7	5, 6	sstri 3990	. . . . . . . 8 ⊢ 𝑍 ⊆ ℝ
8	7	a1i 11	. . . . . . 7 ⊢ (𝜑 → 𝑍 ⊆ ℝ)
9		caucvg.2	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐹‘𝑘) ∈ ℂ)
10	2	eqcomi 2741	. . . . . . . 8 ⊢ (𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛)) = (𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))
11	9, 10	fmptd 7110	. . . . . . 7 ⊢ (𝜑 → (𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛)):𝑍⟶ℂ)
12		1rp 12974	. . . . . . . . . . 11 ⊢ 1 ∈ ℝ⁺
13	12	ne0ii 4336	. . . . . . . . . 10 ⊢ ℝ⁺ ≠ ∅
14		caucvg.3	. . . . . . . . . 10 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥)
15		r19.2z 4493	. . . . . . . . . 10 ⊢ ((ℝ⁺ ≠ ∅ ∧ ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → ∃𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥)
16	13, 14, 15	sylancr 587	. . . . . . . . 9 ⊢ (𝜑 → ∃𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥)
17		eluzel2 12823	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ (ℤ_≥‘𝑀) → 𝑀 ∈ ℤ)
18	17, 3	eleq2s 2851	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ 𝑍 → 𝑀 ∈ ℤ)
19	18	a1d 25	. . . . . . . . . . 11 ⊢ (𝑗 ∈ 𝑍 → (∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥 → 𝑀 ∈ ℤ))
20	19	rexlimiv 3148	. . . . . . . . . 10 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥 → 𝑀 ∈ ℤ)
21	20	rexlimivw 3151	. . . . . . . . 9 ⊢ (∃𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥 → 𝑀 ∈ ℤ)
22	16, 21	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑀 ∈ ℤ)
23	3	uzsup 13824	. . . . . . . 8 ⊢ (𝑀 ∈ ℤ → sup(𝑍, ℝ^*, < ) = +∞)
24	22, 23	syl 17	. . . . . . 7 ⊢ (𝜑 → sup(𝑍, ℝ^*, < ) = +∞)
25	5	sseli 3977	. . . . . . . . . . . . . . . 16 ⊢ (𝑗 ∈ 𝑍 → 𝑗 ∈ ℤ)
26	5	sseli 3977	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ 𝑍 → 𝑘 ∈ ℤ)
27		eluz 12832	. . . . . . . . . . . . . . . 16 ⊢ ((𝑗 ∈ ℤ ∧ 𝑘 ∈ ℤ) → (𝑘 ∈ (ℤ_≥‘𝑗) ↔ 𝑗 ≤ 𝑘))
28	25, 26, 27	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → (𝑘 ∈ (ℤ_≥‘𝑗) ↔ 𝑗 ≤ 𝑘))
29	28	biimprd 247	. . . . . . . . . . . . . 14 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → (𝑗 ≤ 𝑘 → 𝑘 ∈ (ℤ_≥‘𝑗)))
30		fveq2 6888	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = 𝑘 → (𝐹‘𝑛) = (𝐹‘𝑘))
31		eqid 2732	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛)) = (𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))
32		fvex 6901	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐹‘𝑛) ∈ V
33	30, 31, 32	fvmpt3i 7000	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ 𝑍 → ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑘) = (𝐹‘𝑘))
34		fveq2 6888	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑛 = 𝑗 → (𝐹‘𝑛) = (𝐹‘𝑗))
35	34, 31, 32	fvmpt3i 7000	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑗 ∈ 𝑍 → ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑗) = (𝐹‘𝑗))
36	33, 35	oveqan12rd 7425	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → (((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑘) − ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑗)) = ((𝐹‘𝑘) − (𝐹‘𝑗)))
37	36	fveq2d 6892	. . . . . . . . . . . . . . . 16 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → (abs‘(((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑘) − ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑗))) = (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))))
38	37	breq1d 5157	. . . . . . . . . . . . . . 15 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → ((abs‘(((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑘) − ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑗))) < 𝑥 ↔ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥))
39	38	biimprd 247	. . . . . . . . . . . . . 14 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → ((abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥 → (abs‘(((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑘) − ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑗))) < 𝑥))
40	29, 39	imim12d 81	. . . . . . . . . . . . 13 ⊢ ((𝑗 ∈ 𝑍 ∧ 𝑘 ∈ 𝑍) → ((𝑘 ∈ (ℤ_≥‘𝑗) → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → (𝑗 ≤ 𝑘 → (abs‘(((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑘) − ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑗))) < 𝑥)))
41	40	ex 413	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ 𝑍 → (𝑘 ∈ 𝑍 → ((𝑘 ∈ (ℤ_≥‘𝑗) → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → (𝑗 ≤ 𝑘 → (abs‘(((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑘) − ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑗))) < 𝑥))))
42	41	com23 86	. . . . . . . . . . 11 ⊢ (𝑗 ∈ 𝑍 → ((𝑘 ∈ (ℤ_≥‘𝑗) → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥) → (𝑘 ∈ 𝑍 → (𝑗 ≤ 𝑘 → (abs‘(((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑘) − ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑗))) < 𝑥))))
43	42	ralimdv2 3163	. . . . . . . . . 10 ⊢ (𝑗 ∈ 𝑍 → (∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥 → ∀𝑘 ∈ 𝑍 (𝑗 ≤ 𝑘 → (abs‘(((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑘) − ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑗))) < 𝑥)))
44	43	reximia 3081	. . . . . . . . 9 ⊢ (∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥 → ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ 𝑍 (𝑗 ≤ 𝑘 → (abs‘(((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑘) − ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑗))) < 𝑥))
45	44	ralimi 3083	. . . . . . . 8 ⊢ (∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ (ℤ_≥‘𝑗)(abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ 𝑍 (𝑗 ≤ 𝑘 → (abs‘(((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑘) − ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑗))) < 𝑥))
46	14, 45	syl 17	. . . . . . 7 ⊢ (𝜑 → ∀𝑥 ∈ ℝ⁺ ∃𝑗 ∈ 𝑍 ∀𝑘 ∈ 𝑍 (𝑗 ≤ 𝑘 → (abs‘(((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑘) − ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))‘𝑗))) < 𝑥))
47	8, 11, 24, 46	caucvgr 15618	. . . . . 6 ⊢ (𝜑 → (𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛)) ∈ dom ⇝_𝑟 )
48	11, 24	rlimdm 15491	. . . . . 6 ⊢ (𝜑 → ((𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛)) ∈ dom ⇝_𝑟 ↔ (𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛)) ⇝_𝑟 ( ⇝_𝑟 ‘(𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛)))))
49	47, 48	mpbid 231	. . . . 5 ⊢ (𝜑 → (𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛)) ⇝_𝑟 ( ⇝_𝑟 ‘(𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))))
50	2, 49	eqbrtrid 5182	. . . 4 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘)) ⇝_𝑟 ( ⇝_𝑟 ‘(𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))))
51		eqid 2732	. . . . . 6 ⊢ (𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘)) = (𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘))
52	9, 51	fmptd 7110	. . . . 5 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘)):𝑍⟶ℂ)
53	3, 22, 52	rlimclim 15486	. . . 4 ⊢ (𝜑 → ((𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘)) ⇝_𝑟 ( ⇝_𝑟 ‘(𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))) ↔ (𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘)) ⇝ ( ⇝_𝑟 ‘(𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛)))))
54	50, 53	mpbid 231	. . 3 ⊢ (𝜑 → (𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘)) ⇝ ( ⇝_𝑟 ‘(𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))))
55		caucvg.4	. . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝑉)
56	3, 51	climmpt 15511	. . . 4 ⊢ ((𝑀 ∈ ℤ ∧ 𝐹 ∈ 𝑉) → (𝐹 ⇝ ( ⇝_𝑟 ‘(𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))) ↔ (𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘)) ⇝ ( ⇝_𝑟 ‘(𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛)))))
57	22, 55, 56	syl2anc 584	. . 3 ⊢ (𝜑 → (𝐹 ⇝ ( ⇝_𝑟 ‘(𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))) ↔ (𝑘 ∈ 𝑍 ↦ (𝐹‘𝑘)) ⇝ ( ⇝_𝑟 ‘(𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛)))))
58	54, 57	mpbird 256	. 2 ⊢ (𝜑 → 𝐹 ⇝ ( ⇝_𝑟 ‘(𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))))
59		climrel 15432	. . 3 ⊢ Rel ⇝
60	59	releldmi 5945	. 2 ⊢ (𝐹 ⇝ ( ⇝_𝑟 ‘(𝑛 ∈ 𝑍 ↦ (𝐹‘𝑛))) → 𝐹 ∈ dom ⇝ )
61	58, 60	syl 17	1 ⊢ (𝜑 → 𝐹 ∈ dom ⇝ )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ≠ wne 2940 ∀wral 3061 ∃wrex 3070 ⊆ wss 3947 ∅c0 4321 class class class wbr 5147 ↦ cmpt 5230 dom cdm 5675 ‘cfv 6540 (class class class)co 7405 supcsup 9431 ℂcc 11104 ℝcr 11105 1c1 11107 +∞cpnf 11241 ℝ^*cxr 11243 < clt 11244 ≤ cle 11245 − cmin 11440 ℤcz 12554 ℤ_≥cuz 12818 ℝ⁺crp 12970 abscabs 15177 ⇝ cli 15424 ⇝_𝑟 crli 15425

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-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-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-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: caucvgb 15622 cvgcmpce 15760 ulmcau 25898 dchrisumlem3 26983 rrncmslem 36688

W3C validator