| 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 6945 | . . . 4 ⊢ (𝜑 → 𝐹 = (𝑛 ∈ 𝐴 ↦ (𝐹‘𝑛))) |
| 3 | 1 | ffvelcdmda 7076 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (𝐹‘𝑛) ∈ ℂ) |
| 4 | 3 | replimd 15344 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (𝐹‘𝑛) = ((ℜ‘(𝐹‘𝑛)) + (i · (ℑ‘(𝐹‘𝑛))))) |
| 5 | 4 | mpteq2dva 5198 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ (𝐹‘𝑛)) = (𝑛 ∈ 𝐴 ↦ ((ℜ‘(𝐹‘𝑛)) + (i · (ℑ‘(𝐹‘𝑛)))))) |
| 6 | 2, 5 | eqtrd 2796 | . . 3 ⊢ (𝜑 → 𝐹 = (𝑛 ∈ 𝐴 ↦ ((ℜ‘(𝐹‘𝑛)) + (i · (ℑ‘(𝐹‘𝑛)))))) |
| 7 | fvexd 6892 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (ℜ‘(𝐹‘𝑛)) ∈ V) | |
| 8 | ovexd 7447 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (i · (ℑ‘(𝐹‘𝑛))) ∈ V) | |
| 9 | caucvgr.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ⊆ ℝ) | |
| 10 | caucvgr.3 | . . . . 5 ⊢ (𝜑 → sup(𝐴, ℝ*, < ) = +∞) | |
| 11 | caucvgr.4 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ ℝ+ ∃𝑗 ∈ 𝐴 ∀𝑘 ∈ 𝐴 (𝑗 ≤ 𝑘 → (abs‘((𝐹‘𝑘) − (𝐹‘𝑗))) < 𝑥)) | |
| 12 | ref 15259 | . . . . 5 ⊢ ℜ:ℂ⟶ℝ | |
| 13 | resub 15274 | . . . . . . 7 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (ℜ‘((𝐹‘𝑘) − (𝐹‘𝑗))) = ((ℜ‘(𝐹‘𝑘)) − (ℜ‘(𝐹‘𝑗)))) | |
| 14 | 13 | fveq2d 6881 | . . . . . 6 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘(ℜ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) = (abs‘((ℜ‘(𝐹‘𝑘)) − (ℜ‘(𝐹‘𝑗))))) |
| 15 | subcl 11537 | . . . . . . 7 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → ((𝐹‘𝑘) − (𝐹‘𝑗)) ∈ ℂ) | |
| 16 | absrele 15455 | . . . . . . 7 ⊢ (((𝐹‘𝑘) − (𝐹‘𝑗)) ∈ ℂ → (abs‘(ℜ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) | |
| 17 | 15, 16 | syl 18 | . . . . . 6 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘(ℜ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) |
| 18 | 14, 17 | eqbrtrrd 5129 | . . . . 5 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘((ℜ‘(𝐹‘𝑘)) − (ℜ‘(𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) |
| 19 | 9, 1, 10, 11, 12, 18 | caucvgrlem2 15822 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ (ℜ‘(𝐹‘𝑛))) ⇝𝑟 ( ⇝𝑟 ‘(ℜ ∘ 𝐹))) |
| 20 | ax-icn 11240 | . . . . . . 7 ⊢ i ∈ ℂ | |
| 21 | 20 | elexi 3473 | . . . . . 6 ⊢ i ∈ V |
| 22 | 21 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → i ∈ V) |
| 23 | fvexd 6892 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝐴) → (ℑ‘(𝐹‘𝑛)) ∈ V) | |
| 24 | rlimconst 15691 | . . . . . 6 ⊢ ((𝐴 ⊆ ℝ ∧ i ∈ ℂ) → (𝑛 ∈ 𝐴 ↦ i) ⇝𝑟 i) | |
| 25 | 9, 20, 24 | sylancl 598 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ i) ⇝𝑟 i) |
| 26 | imf 15260 | . . . . . 6 ⊢ ℑ:ℂ⟶ℝ | |
| 27 | imsub 15282 | . . . . . . . 8 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (ℑ‘((𝐹‘𝑘) − (𝐹‘𝑗))) = ((ℑ‘(𝐹‘𝑘)) − (ℑ‘(𝐹‘𝑗)))) | |
| 28 | 27 | fveq2d 6881 | . . . . . . 7 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘(ℑ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) = (abs‘((ℑ‘(𝐹‘𝑘)) − (ℑ‘(𝐹‘𝑗))))) |
| 29 | absimle 15456 | . . . . . . . 8 ⊢ (((𝐹‘𝑘) − (𝐹‘𝑗)) ∈ ℂ → (abs‘(ℑ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) | |
| 30 | 15, 29 | syl 18 | . . . . . . 7 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘(ℑ‘((𝐹‘𝑘) − (𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) |
| 31 | 28, 30 | eqbrtrrd 5129 | . . . . . 6 ⊢ (((𝐹‘𝑘) ∈ ℂ ∧ (𝐹‘𝑗) ∈ ℂ) → (abs‘((ℑ‘(𝐹‘𝑘)) − (ℑ‘(𝐹‘𝑗)))) ≤ (abs‘((𝐹‘𝑘) − (𝐹‘𝑗)))) |
| 32 | 9, 1, 10, 11, 26, 31 | caucvgrlem2 15822 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ (ℑ‘(𝐹‘𝑛))) ⇝𝑟 ( ⇝𝑟 ‘(ℑ ∘ 𝐹))) |
| 33 | 22, 23, 25, 32 | rlimmul 15792 | . . . 4 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ (i · (ℑ‘(𝐹‘𝑛)))) ⇝𝑟 (i · ( ⇝𝑟 ‘(ℑ ∘ 𝐹)))) |
| 34 | 7, 8, 19, 33 | rlimadd 15790 | . . 3 ⊢ (𝜑 → (𝑛 ∈ 𝐴 ↦ ((ℜ‘(𝐹‘𝑛)) + (i · (ℑ‘(𝐹‘𝑛))))) ⇝𝑟 (( ⇝𝑟 ‘(ℜ ∘ 𝐹)) + (i · ( ⇝𝑟 ‘(ℑ ∘ 𝐹))))) |
| 35 | 6, 34 | eqbrtrd 5127 | . 2 ⊢ (𝜑 → 𝐹 ⇝𝑟 (( ⇝𝑟 ‘(ℜ ∘ 𝐹)) + (i · ( ⇝𝑟 ‘(ℑ ∘ 𝐹))))) |
| 36 | rlimrel 15640 | . . 3 ⊢ Rel ⇝𝑟 | |
| 37 | 36 | releldmi 5930 | . 2 ⊢ (𝐹 ⇝𝑟 (( ⇝𝑟 ‘(ℜ ∘ 𝐹)) + (i · ( ⇝𝑟 ‘(ℑ ∘ 𝐹)))) → 𝐹 ∈ dom ⇝𝑟 ) |
| 38 | 35, 37 | syl 18 | 1 ⊢ (𝜑 → 𝐹 ∈ dom ⇝𝑟 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3077 ∃wrex 3087 Vcvv 3451 ⊆ wss 3899 class class class wbr 5103 ↦ cmpt 5186 dom cdm 5651 ∘ ccom 5655 ⟶wf 6527 ‘cfv 6531 (class class class)co 7412 supcsup 9416 ℂcc 11179 ℝcr 11180 ici 11183 + caddc 11184 · cmul 11186 +∞cpnf 11321 ℝ*cxr 11323 < clt 11324 ≤ cle 11325 − cmin 11522 ℝ+crp 13101 ℜcre 15244 ℑcim 15245 abscabs 15381 ⇝𝑟 crli 15632 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-pre-sup 11259 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-pm 8834 df-en 8958 df-dom 8959 df-sdom 8960 df-sup 9418 df-inf 9419 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-2 12386 df-3 12387 df-n0 12588 df-z 12675 df-uz 12947 df-rp 13102 df-ico 13463 df-seq 14125 df-exp 14185 df-cj 15246 df-re 15247 df-im 15248 df-sqrt 15382 df-abs 15383 df-limsup 15618 df-rlim 15636 |
| This theorem is used by: caucvg 15826 dvfsumrlim 26331 |
| Copyright terms: Public domain | W3C validator |