Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > caucvgr | Structured version Visualization version GIF version |
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.) (Revised by Mario Carneiro, 8-May-2016.) |
Ref | Expression |
---|---|
caucvgr.1 | ⊢ (𝜑 → 𝐴 ⊆ ℝ) |
caucvgr.2 | ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) |
caucvgr.3 | ⊢ (𝜑 → sup(𝐴, ℝ*, < ) = +∞) |
caucvgr.4 | ⊢ (𝜑 → ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥)) |
Ref | Expression |
---|---|
caucvgr | ⊢ (𝜑 → 𝐹 ∈ dom ⇝𝑟 ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | caucvgr.2 | . . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶ℂ) | |
2 | 1 | feqmptd 6837 | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑛 ∈ 𝐴 ↦ (𝐹‘𝑛))) |
3 | 1 | ffvelrnda 6961 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (𝐹‘𝑛) ∈ ℂ) |
4 | 3 | replimd 14908 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (𝐹‘𝑛) = ((ℜ‘(𝐹‘𝑛)) + (i · (ℑ‘(𝐹‘𝑛))))) |
5 | 4 | mpteq2dva 5174 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ (𝐹‘𝑛)) = (𝑛 ∈ 𝐴 ↦ ((ℜ‘(𝐹‘𝑛)) + (i · (ℑ‘(𝐹‘𝑛)))))) |
6 | 2, 5 | eqtrd 2778 | . . 3 ⊢ (𝜑 → 𝐹 = (𝑛 ∈ 𝐴 ↦ ((ℜ‘(𝐹‘𝑛)) + (i · (ℑ‘(𝐹‘𝑛)))))) |
7 | fvexd 6789 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (ℜ‘(𝐹‘𝑛)) ∈ V) | |
8 | ovexd 7310 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (i · (ℑ‘(𝐹‘𝑛))) ∈ V) | |
9 | caucvgr.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
10 | caucvgr.3 | . . . . 5 ⊢ (𝜑 → sup(𝐴, ℝ*, < ) = +∞) | |
11 | caucvgr.4 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥)) | |
12 | ref 14823 | . . . . 5 ⊢ ℜ:ℂ⟶ℝ | |
13 | resub 14838 | . . . . . . 7 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (ℜ‘((𝐹‘𝑘) − (𝐹‘𝑗))) = ((ℜ‘(𝐹‘𝑘)) − (ℜ‘(𝐹‘𝑗)))) | |
14 | 13 | fveq2d 6778 | . . . . . 6 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘(ℜ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) = (abs‘((ℜ‘(𝐹‘𝑘)) − (ℜ‘(𝐹‘𝑗))))) |
15 | subcl 11220 | . . . . . . 7 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → ((𝐹‘𝑘) − (𝐹‘𝑗)) ∈ ℂ) | |
16 | absrele 15020 | . . . . . . 7 ⊢ (((𝐹‘𝑘) − (𝐹‘𝑗)) ∈ ℂ → (abs‘(ℜ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) | |
17 | 15, 16 | syl 17 | . . . . . 6 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘(ℜ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) |
18 | 14, 17 | eqbrtrrd 5098 | . . . . 5 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘((ℜ‘(𝐹‘𝑘)) − (ℜ‘(𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) |
19 | 9, 1, 10, 11, 12, 18 | caucvgrlem2 15386 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ (ℜ‘(𝐹‘𝑛))) ⇝𝑟 ( ⇝𝑟 ‘(ℜ ∘ 𝐹))) |
20 | ax-icn 10930 | . . . . . . 7 ⊢ i ∈ ℂ | |
21 | 20 | elexi 3451 | . . . . . 6 ⊢ i ∈ V |
22 | 21 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → i ∈ V) |
23 | fvexd 6789 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (ℑ‘(𝐹‘𝑛)) ∈ V) | |
24 | rlimconst 15253 | . . . . . 6 ⊢ ((𝐴 ⊆ ℝ ∧ i ∈ ℂ) → (𝑛 ∈ 𝐴 ↦ i) ⇝𝑟 i) | |
25 | 9, 20, 24 | sylancl 586 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ i) ⇝𝑟 i) |
26 | imf 14824 | . . . . . 6 ⊢ ℑ:ℂ⟶ℝ | |
27 | imsub 14846 | . . . . . . . 8 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (ℑ‘((𝐹‘𝑘) − (𝐹‘𝑗))) = ((ℑ‘(𝐹‘𝑘)) − (ℑ‘(𝐹‘𝑗)))) | |
28 | 27 | fveq2d 6778 | . . . . . . 7 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘(ℑ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) = (abs‘((ℑ‘(𝐹‘𝑘)) − (ℑ‘(𝐹‘𝑗))))) |
29 | absimle 15021 | . . . . . . . 8 ⊢ (((𝐹‘𝑘) − (𝐹‘𝑗)) ∈ ℂ → (abs‘(ℑ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) | |
30 | 15, 29 | syl 17 | . . . . . . 7 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘(ℑ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) |
31 | 28, 30 | eqbrtrrd 5098 | . . . . . 6 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘((ℑ‘(𝐹‘𝑘)) − (ℑ‘(𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) |
32 | 9, 1, 10, 11, 26, 31 | caucvgrlem2 15386 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ (ℑ‘(𝐹‘𝑛))) ⇝𝑟 ( ⇝𝑟 ‘(ℑ ∘ 𝐹))) |
33 | 22, 23, 25, 32 | rlimmul 15355 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ (i · (ℑ‘(𝐹‘𝑛)))) ⇝𝑟 (i · ( ⇝𝑟 ‘(ℑ ∘ 𝐹)))) |
34 | 7, 8, 19, 33 | rlimadd 15352 | . . 3 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ ((ℜ‘(𝐹‘𝑛)) + (i · (ℑ‘(𝐹‘𝑛))))) ⇝𝑟 (( ⇝𝑟 ‘(ℜ ∘ 𝐹)) + (i · ( ⇝𝑟 ‘(ℑ ∘ 𝐹))))) |
35 | 6, 34 | eqbrtrd 5096 | . 2 ⊢ (𝜑 → 𝐹 ⇝𝑟 (( ⇝𝑟 ‘(ℜ ∘ 𝐹)) + (i · ( ⇝𝑟 ‘(ℑ ∘ 𝐹))))) |
36 | rlimrel 15202 | . . 3 ⊢ Rel ⇝𝑟 | |
37 | 36 | releldmi 5857 | . 2 ⊢ (𝐹 ⇝𝑟 (( ⇝𝑟 ‘(ℜ ∘ 𝐹)) + (i · ( ⇝𝑟 ‘(ℑ ∘ 𝐹)))) → 𝐹 ∈ dom ⇝𝑟 ) |
38 | 35, 37 | syl 17 | 1 ⊢ (𝜑 → 𝐹 ∈ dom ⇝𝑟 ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ∀wral 3064 ∃wrex 3065 Vcvv 3432 ⊆ wss 3887 class class class wbr 5074 ↦ cmpt 5157 dom cdm 5589 ∘ ccom 5593 ⟶wf 6429 ‘cfv 6433 (class class class)co 7275 supcsup 9199 ℂcc 10869 ℝcr 10870 ici 10873 + caddc 10874 · cmul 10876 +∞cpnf 11006 ℝ*cxr 11008 < clt 11009 ≤ cle 11010 − cmin 11205 ℝ+crp 12730 ℜcre 14808 ℑcim 14809 abscabs 14945 ⇝𝑟 crli 15194 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-iun 4926 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-om 7713 df-2nd 7832 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-er 8498 df-pm 8618 df-en 8734 df-dom 8735 df-sdom 8736 df-sup 9201 df-inf 9202 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-3 12037 df-n0 12234 df-z 12320 df-uz 12583 df-rp 12731 df-ico 13085 df-seq 13722 df-exp 13783 df-cj 14810 df-re 14811 df-im 14812 df-sqrt 14946 df-abs 14947 df-limsup 15180 df-rlim 15198 |
This theorem is referenced by: caucvg 15390 dvfsumrlim 25195 |
Copyright terms: Public domain | W3C validator |