Metamath Proof Explorer


Theorem taylf

Description: The Taylor series defines a function on a subset of the complex numbers. (Contributed by Mario Carneiro, 30-Dec-2016)

Ref Expression
Hypotheses taylfval.s ⊢ φ → S ∈ ℝ ℂ
taylfval.f ⊢ φ → F : A ⟶ ℂ
taylfval.a ⊢ φ → A ⊆ S
taylfval.n ⊢ φ → N ∈ ℕ 0 ∨ N = +∞
taylfval.b ⊢ φ ∧ k ∈ 0 N ∩ ℤ → B ∈ dom ⁡ S D n F ⁡ k
taylfval.t ⊢ T = N S Tayl F B
Assertion taylf ⊢ φ → T : dom ⁡ T ⟶ ℂ

Proof

Step Hyp Ref Expression
1 taylfval.s ⊢ φ → S ∈ ℝ ℂ
2 taylfval.f ⊢ φ → F : A ⟶ ℂ
3 taylfval.a ⊢ φ → A ⊆ S
4 taylfval.n ⊢ φ → N ∈ ℕ 0 ∨ N = +∞
5 taylfval.b ⊢ φ ∧ k ∈ 0 N ∩ ℤ → B ∈ dom ⁡ S D n F ⁡ k
6 taylfval.t ⊢ T = N S Tayl F B
7 1 2 3 4 5 6 taylfval ⊢ φ → T = ⋃ x ∈ ℂ x × ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k
8 simpr ⊢ φ ∧ x ∈ ℂ → x ∈ ℂ
9 8 snssd ⊢ φ ∧ x ∈ ℂ → x ⊆ ℂ
10 1 2 3 4 5 taylfvallem ⊢ φ ∧ x ∈ ℂ → ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k ⊆ ℂ
11 xpss12 ⊢ x ⊆ ℂ ∧ ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k ⊆ ℂ → x × ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k ⊆ ℂ × ℂ
12 9 10 11 syl2anc ⊢ φ ∧ x ∈ ℂ → x × ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k ⊆ ℂ × ℂ
13 12 ralrimiva ⊢ φ → ∀ x ∈ ℂ x × ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k ⊆ ℂ × ℂ
14 iunss ⊢ ⋃ x ∈ ℂ x × ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k ⊆ ℂ × ℂ ↔ ∀ x ∈ ℂ x × ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k ⊆ ℂ × ℂ
15 13 14 sylibr ⊢ φ → ⋃ x ∈ ℂ x × ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k ⊆ ℂ × ℂ
16 7 15 eqsstrd ⊢ φ → T ⊆ ℂ × ℂ
17 relxp ⊢ Rel ⁡ ℂ × ℂ
18 relss ⊢ T ⊆ ℂ × ℂ → Rel ⁡ ℂ × ℂ → Rel ⁡ T
19 16 17 18 mpisyl ⊢ φ → Rel ⁡ T
20 1 2 3 4 5 6 eltayl ⊢ φ → x T y ↔ x ∈ ℂ ∧ y ∈ ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k
21 20 biimpd ⊢ φ → x T y → x ∈ ℂ ∧ y ∈ ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k
22 21 alrimiv ⊢ φ → ∀ y x T y → x ∈ ℂ ∧ y ∈ ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k
23 cnfldbas ⊢ ℂ = Base ℂ fld
24 cnring ⊢ ℂ fld ∈ Ring
25 ringcmn ⊢ ℂ fld ∈ Ring → ℂ fld ∈ CMnd
26 24 25 mp1i ⊢ φ ∧ x ∈ ℂ → ℂ fld ∈ CMnd
27 cnfldtps ⊢ ℂ fld ∈ TopSp
28 27 a1i ⊢ φ ∧ x ∈ ℂ → ℂ fld ∈ TopSp
29 ovex ⊢ 0 N ∈ V
30 29 inex1 ⊢ 0 N ∩ ℤ ∈ V
31 30 a1i ⊢ φ ∧ x ∈ ℂ → 0 N ∩ ℤ ∈ V
32 1 2 3 4 5 taylfvallem1 ⊢ φ ∧ x ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → S D n F ⁡ k ⁡ B k ! ⁢ x − B k ∈ ℂ
33 32 fmpttd ⊢ φ ∧ x ∈ ℂ → k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k : 0 N ∩ ℤ ⟶ ℂ
34 eqid ⊢ TopOpen ⁡ ℂ fld = TopOpen ⁡ ℂ fld
35 34 cnfldhaus ⊢ TopOpen ⁡ ℂ fld ∈ Haus
36 35 a1i ⊢ φ ∧ x ∈ ℂ → TopOpen ⁡ ℂ fld ∈ Haus
37 23 26 28 31 33 34 36 haustsms ⊢ φ ∧ x ∈ ℂ → ∃* y y ∈ ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k
38 37 ex ⊢ φ → x ∈ ℂ → ∃* y y ∈ ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k
39 moanimv ⊢ ∃* y x ∈ ℂ ∧ y ∈ ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k ↔ x ∈ ℂ → ∃* y y ∈ ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k
40 38 39 sylibr ⊢ φ → ∃* y x ∈ ℂ ∧ y ∈ ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k
41 moim ⊢ ∀ y x T y → x ∈ ℂ ∧ y ∈ ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k → ∃* y x ∈ ℂ ∧ y ∈ ℂ fld tsums k ∈ 0 N ∩ ℤ ⟼ S D n F ⁡ k ⁡ B k ! ⁢ x − B k → ∃* y x T y
42 22 40 41 sylc ⊢ φ → ∃* y x T y
43 42 alrimiv ⊢ φ → ∀ x ∃* y x T y
44 dffun6 ⊢ Fun ⁡ T ↔ Rel ⁡ T ∧ ∀ x ∃* y x T y
45 19 43 44 sylanbrc ⊢ φ → Fun ⁡ T
46 45 funfnd ⊢ φ → T Fn dom ⁡ T
47 rnss ⊢ T ⊆ ℂ × ℂ → ran ⁡ T ⊆ ran ⁡ ℂ × ℂ
48 16 47 syl ⊢ φ → ran ⁡ T ⊆ ran ⁡ ℂ × ℂ
49 rnxpss ⊢ ran ⁡ ℂ × ℂ ⊆ ℂ
50 48 49 sstrdi ⊢ φ → ran ⁡ T ⊆ ℂ
51 df-f ⊢ T : dom ⁡ T ⟶ ℂ ↔ T Fn dom ⁡ T ∧ ran ⁡ T ⊆ ℂ
52 46 50 51 sylanbrc ⊢ φ → T : dom ⁡ T ⟶ ℂ