Metamath Proof Explorer


Theorem psergf

Description: The sequence of terms in the infinite sequence defining a power series for fixed X . (Contributed by Mario Carneiro, 26-Feb-2015)

Ref Expression
Hypotheses pser.g ⊢ G = x ∈ ℂ ⟼ n ∈ ℕ 0 ⟼ A ⁡ n ⁢ x n
radcnv.a ⊢ φ → A : ℕ 0 ⟶ ℂ
psergf.x ⊢ φ → X ∈ ℂ
Assertion psergf ⊢ φ → G ⁡ X : ℕ 0 ⟶ ℂ

Proof

Step Hyp Ref Expression
1 pser.g ⊢ G = x ∈ ℂ ⟼ n ∈ ℕ 0 ⟼ A ⁡ n ⁢ x n
2 radcnv.a ⊢ φ → A : ℕ 0 ⟶ ℂ
3 psergf.x ⊢ φ → X ∈ ℂ
4 1 pserval ⊢ X ∈ ℂ → G ⁡ X = m ∈ ℕ 0 ⟼ A ⁡ m ⁢ X m
5 4 adantl ⊢ A : ℕ 0 ⟶ ℂ ∧ X ∈ ℂ → G ⁡ X = m ∈ ℕ 0 ⟼ A ⁡ m ⁢ X m
6 ffvelcdm ⊢ A : ℕ 0 ⟶ ℂ ∧ m ∈ ℕ 0 → A ⁡ m ∈ ℂ
7 6 adantlr ⊢ A : ℕ 0 ⟶ ℂ ∧ X ∈ ℂ ∧ m ∈ ℕ 0 → A ⁡ m ∈ ℂ
8 expcl ⊢ X ∈ ℂ ∧ m ∈ ℕ 0 → X m ∈ ℂ
9 8 adantll ⊢ A : ℕ 0 ⟶ ℂ ∧ X ∈ ℂ ∧ m ∈ ℕ 0 → X m ∈ ℂ
10 7 9 mulcld ⊢ A : ℕ 0 ⟶ ℂ ∧ X ∈ ℂ ∧ m ∈ ℕ 0 → A ⁡ m ⁢ X m ∈ ℂ
11 5 10 fmpt3d ⊢ A : ℕ 0 ⟶ ℂ ∧ X ∈ ℂ → G ⁡ X : ℕ 0 ⟶ ℂ
12 2 3 11 syl2anc ⊢ φ → G ⁡ X : ℕ 0 ⟶ ℂ