Metamath Proof Explorer


Theorem caucvgr

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
Hypotheses caucvgr.1 ⊢ φ → A ⊆ ℝ
caucvgr.2 ⊢ φ → F : A ⟶ ℂ
caucvgr.3 ⊢ φ → sup A ℝ * < = +∞
caucvgr.4 ⊢ φ → ∀ x ∈ ℝ + ∃ j ∈ A ∀ k ∈ A j ≤ k → F ⁡ k − F ⁡ j < x
Assertion caucvgr ⊢ φ → F ∈ dom ⁡ ⇝ℝ

Proof

Step Hyp Ref Expression
1 caucvgr.1 ⊢ φ → A ⊆ ℝ
2 caucvgr.2 ⊢ φ → F : A ⟶ ℂ
3 caucvgr.3 ⊢ φ → sup A ℝ * < = +∞
4 caucvgr.4 ⊢ φ → ∀ x ∈ ℝ + ∃ j ∈ A ∀ k ∈ A j ≤ k → F ⁡ k − F ⁡ j < x
5 2 feqmptd ⊢ φ → F = n ∈ A ⟼ F ⁡ n
6 2 ffvelcdmda ⊢ φ ∧ n ∈ A → F ⁡ n ∈ ℂ
7 6 replimd ⊢ φ ∧ n ∈ A → F ⁡ n = ℜ ⁡ F ⁡ n + i ⁢ ℑ ⁡ F ⁡ n
8 7 mpteq2dva ⊢ φ → n ∈ A ⟼ F ⁡ n = n ∈ A ⟼ ℜ ⁡ F ⁡ n + i ⁢ ℑ ⁡ F ⁡ n
9 5 8 eqtrd ⊢ φ → F = n ∈ A ⟼ ℜ ⁡ F ⁡ n + i ⁢ ℑ ⁡ F ⁡ n
10 fvexd ⊢ φ ∧ n ∈ A → ℜ ⁡ F ⁡ n ∈ V
11 ovexd ⊢ φ ∧ n ∈ A → i ⁢ ℑ ⁡ F ⁡ n ∈ V
12 ref ⊢ ℜ : ℂ ⟶ ℝ
13 resub ⊢ F ⁡ k ∈ ℂ ∧ F ⁡ j ∈ ℂ → ℜ ⁡ F ⁡ k − F ⁡ j = ℜ ⁡ F ⁡ k − ℜ ⁡ F ⁡ j
14 13 fveq2d ⊢ F ⁡ k ∈ ℂ ∧ F ⁡ j ∈ ℂ → ℜ ⁡ F ⁡ k − F ⁡ j = ℜ ⁡ F ⁡ k − ℜ ⁡ F ⁡ j
15 subcl ⊢ F ⁡ k ∈ ℂ ∧ F ⁡ j ∈ ℂ → F ⁡ k − F ⁡ j ∈ ℂ
16 absrele ⊢ F ⁡ k − F ⁡ j ∈ ℂ → ℜ ⁡ F ⁡ k − F ⁡ j ≤ F ⁡ k − F ⁡ j
17 15 16 syl ⊢ F ⁡ k ∈ ℂ ∧ F ⁡ j ∈ ℂ → ℜ ⁡ F ⁡ k − F ⁡ j ≤ F ⁡ k − F ⁡ j
18 14 17 eqbrtrrd ⊢ F ⁡ k ∈ ℂ ∧ F ⁡ j ∈ ℂ → ℜ ⁡ F ⁡ k − ℜ ⁡ F ⁡ j ≤ F ⁡ k − F ⁡ j
19 1 2 3 4 12 18 caucvgrlem2 ⊢ φ → n ∈ A ⟼ ℜ ⁡ F ⁡ n ⇝ℝ ⇝ℝ ⁡ ℜ ∘ F
20 ax-icn ⊢ i ∈ ℂ
21 20 elexi ⊢ i ∈ V
22 21 a1i ⊢ φ ∧ n ∈ A → i ∈ V
23 fvexd ⊢ φ ∧ n ∈ A → ℑ ⁡ F ⁡ n ∈ V
24 rlimconst ⊢ A ⊆ ℝ ∧ i ∈ ℂ → n ∈ A ⟼ i ⇝ℝ i
25 1 20 24 sylancl ⊢ φ → n ∈ A ⟼ i ⇝ℝ i
26 imf ⊢ ℑ : ℂ ⟶ ℝ
27 imsub ⊢ F ⁡ k ∈ ℂ ∧ F ⁡ j ∈ ℂ → ℑ ⁡ F ⁡ k − F ⁡ j = ℑ ⁡ F ⁡ k − ℑ ⁡ F ⁡ j
28 27 fveq2d ⊢ F ⁡ k ∈ ℂ ∧ F ⁡ j ∈ ℂ → ℑ ⁡ F ⁡ k − F ⁡ j = ℑ ⁡ F ⁡ k − ℑ ⁡ F ⁡ j
29 absimle ⊢ F ⁡ k − F ⁡ j ∈ ℂ → ℑ ⁡ F ⁡ k − F ⁡ j ≤ F ⁡ k − F ⁡ j
30 15 29 syl ⊢ F ⁡ k ∈ ℂ ∧ F ⁡ j ∈ ℂ → ℑ ⁡ F ⁡ k − F ⁡ j ≤ F ⁡ k − F ⁡ j
31 28 30 eqbrtrrd ⊢ F ⁡ k ∈ ℂ ∧ F ⁡ j ∈ ℂ → ℑ ⁡ F ⁡ k − ℑ ⁡ F ⁡ j ≤ F ⁡ k − F ⁡ j
32 1 2 3 4 26 31 caucvgrlem2 ⊢ φ → n ∈ A ⟼ ℑ ⁡ F ⁡ n ⇝ℝ ⇝ℝ ⁡ ℑ ∘ F
33 22 23 25 32 rlimmul ⊢ φ → n ∈ A ⟼ i ⁢ ℑ ⁡ F ⁡ n ⇝ℝ i ⁢ ⇝ℝ ⁡ ℑ ∘ F
34 10 11 19 33 rlimadd ⊢ φ → n ∈ A ⟼ ℜ ⁡ F ⁡ n + i ⁢ ℑ ⁡ F ⁡ n ⇝ℝ ⇝ℝ ⁡ ℜ ∘ F + i ⁢ ⇝ℝ ⁡ ℑ ∘ F
35 9 34 eqbrtrd ⊢ φ → F ⇝ℝ ⇝ℝ ⁡ ℜ ∘ F + i ⁢ ⇝ℝ ⁡ ℑ ∘ F
36 rlimrel ⊢ Rel ⁡ ⇝ℝ
37 36 releldmi ⊢ F ⇝ℝ ⇝ℝ ⁡ ℜ ∘ F + i ⁢ ⇝ℝ ⁡ ℑ ∘ F → F ∈ dom ⁡ ⇝ℝ
38 35 37 syl ⊢ φ → F ∈ dom ⁡ ⇝ℝ