| 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 6912 | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑛 ∈ 𝐴 ↦ (𝐹‘𝑛))) |
| 3 | 1 | ffvelcdmda 7040 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (𝐹‘𝑛) ∈ ℂ) |
| 4 | 3 | replimd 15134 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (𝐹‘𝑛) = ((ℜ‘(𝐹‘𝑛)) + (i · (ℑ‘(𝐹‘𝑛))))) |
| 5 | 4 | mpteq2dva 5193 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ (𝐹‘𝑛)) = (𝑛 ∈ 𝐴 ↦ ((ℜ‘(𝐹‘𝑛)) + (i · (ℑ‘(𝐹‘𝑛)))))) |
| 6 | 2, 5 | eqtrd 2772 | . . 3 ⊢ (𝜑 → 𝐹 = (𝑛 ∈ 𝐴 ↦ ((ℜ‘(𝐹‘𝑛)) + (i · (ℑ‘(𝐹‘𝑛)))))) |
| 7 | fvexd 6859 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (ℜ‘(𝐹‘𝑛)) ∈ V) | |
| 8 | ovexd 7405 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (i · (ℑ‘(𝐹‘𝑛))) ∈ V) | |
| 9 | caucvgr.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
| 10 | caucvgr.3 | . . . . 5 ⊢ (𝜑 → sup(𝐴, ℝ*, < ) = +∞) | |
| 11 | caucvgr.4 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥)) | |
| 12 | ref 15049 | . . . . 5 ⊢ ℜ:ℂ⟶ℝ | |
| 13 | resub 15064 | . . . . . . 7 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (ℜ‘((𝐹‘𝑘) − (𝐹‘𝑗))) = ((ℜ‘(𝐹‘𝑘)) − (ℜ‘(𝐹‘𝑗)))) | |
| 14 | 13 | fveq2d 6848 | . . . . . 6 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘(ℜ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) = (abs‘((ℜ‘(𝐹‘𝑘)) − (ℜ‘(𝐹‘𝑗))))) |
| 15 | subcl 11393 | . . . . . . 7 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → ((𝐹‘𝑘) − (𝐹‘𝑗)) ∈ ℂ) | |
| 16 | absrele 15245 | . . . . . . 7 ⊢ (((𝐹‘𝑘) − (𝐹‘𝑗)) ∈ ℂ → (abs‘(ℜ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) | |
| 17 | 15, 16 | syl 17 | . . . . . 6 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘(ℜ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) |
| 18 | 14, 17 | eqbrtrrd 5124 | . . . . 5 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘((ℜ‘(𝐹‘𝑘)) − (ℜ‘(𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) |
| 19 | 9, 1, 10, 11, 12, 18 | caucvgrlem2 15612 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ (ℜ‘(𝐹‘𝑛))) ⇝𝑟 ( ⇝𝑟 ‘(ℜ ∘ 𝐹))) |
| 20 | ax-icn 11099 | . . . . . . 7 ⊢ i ∈ ℂ | |
| 21 | 20 | elexi 3465 | . . . . . 6 ⊢ i ∈ V |
| 22 | 21 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → i ∈ V) |
| 23 | fvexd 6859 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (ℑ‘(𝐹‘𝑛)) ∈ V) | |
| 24 | rlimconst 15481 | . . . . . 6 ⊢ ((𝐴 ⊆ ℝ ∧ i ∈ ℂ) → (𝑛 ∈ 𝐴 ↦ i) ⇝𝑟 i) | |
| 25 | 9, 20, 24 | sylancl 587 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ i) ⇝𝑟 i) |
| 26 | imf 15050 | . . . . . 6 ⊢ ℑ:ℂ⟶ℝ | |
| 27 | imsub 15072 | . . . . . . . 8 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (ℑ‘((𝐹‘𝑘) − (𝐹‘𝑗))) = ((ℑ‘(𝐹‘𝑘)) − (ℑ‘(𝐹‘𝑗)))) | |
| 28 | 27 | fveq2d 6848 | . . . . . . 7 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘(ℑ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) = (abs‘((ℑ‘(𝐹‘𝑘)) − (ℑ‘(𝐹‘𝑗))))) |
| 29 | absimle 15246 | . . . . . . . 8 ⊢ (((𝐹‘𝑘) − (𝐹‘𝑗)) ∈ ℂ → (abs‘(ℑ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) | |
| 30 | 15, 29 | syl 17 | . . . . . . 7 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘(ℑ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) |
| 31 | 28, 30 | eqbrtrrd 5124 | . . . . . 6 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘((ℑ‘(𝐹‘𝑘)) − (ℑ‘(𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) |
| 32 | 9, 1, 10, 11, 26, 31 | caucvgrlem2 15612 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ (ℑ‘(𝐹‘𝑛))) ⇝𝑟 ( ⇝𝑟 ‘(ℑ ∘ 𝐹))) |
| 33 | 22, 23, 25, 32 | rlimmul 15582 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ (i · (ℑ‘(𝐹‘𝑛)))) ⇝𝑟 (i · ( ⇝𝑟 ‘(ℑ ∘ 𝐹)))) |
| 34 | 7, 8, 19, 33 | rlimadd 15580 | . . 3 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ ((ℜ‘(𝐹‘𝑛)) + (i · (ℑ‘(𝐹‘𝑛))))) ⇝𝑟 (( ⇝𝑟 ‘(ℜ ∘ 𝐹)) + (i · ( ⇝𝑟 ‘(ℑ ∘ 𝐹))))) |
| 35 | 6, 34 | eqbrtrd 5122 | . 2 ⊢ (𝜑 → 𝐹 ⇝𝑟 (( ⇝𝑟 ‘(ℜ ∘ 𝐹)) + (i · ( ⇝𝑟 ‘(ℑ ∘ 𝐹))))) |
| 36 | rlimrel 15430 | . . 3 ⊢ Rel ⇝𝑟 | |
| 37 | 36 | releldmi 5907 | . 2 ⊢ (𝐹 ⇝𝑟 (( ⇝𝑟 ‘(ℜ ∘ 𝐹)) + (i · ( ⇝𝑟 ‘(ℑ ∘ 𝐹)))) → 𝐹 ∈ dom ⇝𝑟 ) |
| 38 | 35, 37 | syl 17 | 1 ⊢ (𝜑 → 𝐹 ∈ dom ⇝𝑟 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 Vcvv 3442 ⊆ wss 3903 class class class wbr 5100 ↦ cmpt 5181 dom cdm 5634 ∘ ccom 5638 ⟶wf 6498 ‘cfv 6502 (class class class)co 7370 supcsup 9357 ℂcc 11038 ℝcr 11039 ici 11042 + caddc 11043 · cmul 11045 +∞cpnf 11177 ℝ*cxr 11179 < clt 11180 ≤ cle 11181 − cmin 11378 ℝ+crp 12919 ℜcre 15034 ℑcim 15035 abscabs 15171 ⇝𝑟 crli 15422 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 ax-pre-sup 11118 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-er 8647 df-pm 8780 df-en 8898 df-dom 8899 df-sdom 8900 df-sup 9359 df-inf 9360 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-div 11809 df-nn 12160 df-2 12222 df-3 12223 df-n0 12416 df-z 12503 df-uz 12766 df-rp 12920 df-ico 13281 df-seq 13939 df-exp 13999 df-cj 15036 df-re 15037 df-im 15038 df-sqrt 15172 df-abs 15173 df-limsup 15408 df-rlim 15426 |
| This theorem is referenced by: caucvg 15616 dvfsumrlim 26011 |
| Copyright terms: Public domain | W3C validator |