Metamath Proof Explorer


Theorem plycjlem

Description: Lemma for plycj and coecj . (Contributed by Mario Carneiro, 24-Jul-2014)

Ref Expression
Hypotheses plycjlem.1 ⊢ N = deg ⁡ F
plycjlem.2 ⊢ G = * ∘ F ∘ *
plycjlem.3 ⊢ A = coeff ⁡ F
Assertion plycjlem ⊢ F ∈ Poly ⁡ S → G = z ∈ ℂ ⟼ ∑ k = 0 N * ∘ A ⁡ k ⁢ z k

Proof

Step Hyp Ref Expression
1 plycjlem.1 ⊢ N = deg ⁡ F
2 plycjlem.2 ⊢ G = * ∘ F ∘ *
3 plycjlem.3 ⊢ A = coeff ⁡ F
4 cjcl ⊢ z ∈ ℂ → z ‾ ∈ ℂ
5 4 adantl ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ → z ‾ ∈ ℂ
6 cjf ⊢ * : ℂ ⟶ ℂ
7 6 a1i ⊢ F ∈ Poly ⁡ S → * : ℂ ⟶ ℂ
8 7 feqmptd ⊢ F ∈ Poly ⁡ S → * = z ∈ ℂ ⟼ z ‾
9 fzfid ⊢ F ∈ Poly ⁡ S ∧ x ∈ ℂ → 0 … N ∈ Fin
10 3 coef3 ⊢ F ∈ Poly ⁡ S → A : ℕ 0 ⟶ ℂ
11 10 adantr ⊢ F ∈ Poly ⁡ S ∧ x ∈ ℂ → A : ℕ 0 ⟶ ℂ
12 elfznn0 ⊢ k ∈ 0 … N → k ∈ ℕ 0
13 ffvelcdm ⊢ A : ℕ 0 ⟶ ℂ ∧ k ∈ ℕ 0 → A ⁡ k ∈ ℂ
14 11 12 13 syl2an ⊢ F ∈ Poly ⁡ S ∧ x ∈ ℂ ∧ k ∈ 0 … N → A ⁡ k ∈ ℂ
15 expcl ⊢ x ∈ ℂ ∧ k ∈ ℕ 0 → x k ∈ ℂ
16 12 15 sylan2 ⊢ x ∈ ℂ ∧ k ∈ 0 … N → x k ∈ ℂ
17 16 adantll ⊢ F ∈ Poly ⁡ S ∧ x ∈ ℂ ∧ k ∈ 0 … N → x k ∈ ℂ
18 14 17 mulcld ⊢ F ∈ Poly ⁡ S ∧ x ∈ ℂ ∧ k ∈ 0 … N → A ⁡ k ⁢ x k ∈ ℂ
19 9 18 fsumcl ⊢ F ∈ Poly ⁡ S ∧ x ∈ ℂ → ∑ k = 0 N A ⁡ k ⁢ x k ∈ ℂ
20 3 1 coeid ⊢ F ∈ Poly ⁡ S → F = x ∈ ℂ ⟼ ∑ k = 0 N A ⁡ k ⁢ x k
21 fveq2 ⊢ z = ∑ k = 0 N A ⁡ k ⁢ x k → z ‾ = ∑ k = 0 N A ⁡ k ⁢ x k ‾
22 19 20 8 21 fmptco ⊢ F ∈ Poly ⁡ S → * ∘ F = x ∈ ℂ ⟼ ∑ k = 0 N A ⁡ k ⁢ x k ‾
23 oveq1 ⊢ x = z ‾ → x k = z ‾ k
24 23 oveq2d ⊢ x = z ‾ → A ⁡ k ⁢ x k = A ⁡ k ⁢ z ‾ k
25 24 sumeq2sdv ⊢ x = z ‾ → ∑ k = 0 N A ⁡ k ⁢ x k = ∑ k = 0 N A ⁡ k ⁢ z ‾ k
26 25 fveq2d ⊢ x = z ‾ → ∑ k = 0 N A ⁡ k ⁢ x k ‾ = ∑ k = 0 N A ⁡ k ⁢ z ‾ k ‾
27 5 8 22 26 fmptco ⊢ F ∈ Poly ⁡ S → * ∘ F ∘ * = z ∈ ℂ ⟼ ∑ k = 0 N A ⁡ k ⁢ z ‾ k ‾
28 2 27 eqtrid ⊢ F ∈ Poly ⁡ S → G = z ∈ ℂ ⟼ ∑ k = 0 N A ⁡ k ⁢ z ‾ k ‾
29 fzfid ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ → 0 … N ∈ Fin
30 10 adantr ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ → A : ℕ 0 ⟶ ℂ
31 30 12 13 syl2an ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ ∧ k ∈ 0 … N → A ⁡ k ∈ ℂ
32 expcl ⊢ z ‾ ∈ ℂ ∧ k ∈ ℕ 0 → z ‾ k ∈ ℂ
33 5 12 32 syl2an ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ ∧ k ∈ 0 … N → z ‾ k ∈ ℂ
34 31 33 mulcld ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ ∧ k ∈ 0 … N → A ⁡ k ⁢ z ‾ k ∈ ℂ
35 29 34 fsumcj ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ → ∑ k = 0 N A ⁡ k ⁢ z ‾ k ‾ = ∑ k = 0 N A ⁡ k ⁢ z ‾ k ‾
36 31 33 cjmuld ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ ∧ k ∈ 0 … N → A ⁡ k ⁢ z ‾ k ‾ = A ⁡ k ‾ ⁢ z ‾ k ‾
37 fvco3 ⊢ A : ℕ 0 ⟶ ℂ ∧ k ∈ ℕ 0 → * ∘ A ⁡ k = A ⁡ k ‾
38 30 12 37 syl2an ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ ∧ k ∈ 0 … N → * ∘ A ⁡ k = A ⁡ k ‾
39 cjexp ⊢ z ‾ ∈ ℂ ∧ k ∈ ℕ 0 → z ‾ k ‾ = z ‾ ‾ k
40 5 12 39 syl2an ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ ∧ k ∈ 0 … N → z ‾ k ‾ = z ‾ ‾ k
41 cjcj ⊢ z ∈ ℂ → z ‾ ‾ = z
42 41 ad2antlr ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ ∧ k ∈ 0 … N → z ‾ ‾ = z
43 42 oveq1d ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ ∧ k ∈ 0 … N → z ‾ ‾ k = z k
44 40 43 eqtr2d ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ ∧ k ∈ 0 … N → z k = z ‾ k ‾
45 38 44 oveq12d ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ ∧ k ∈ 0 … N → * ∘ A ⁡ k ⁢ z k = A ⁡ k ‾ ⁢ z ‾ k ‾
46 36 45 eqtr4d ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ ∧ k ∈ 0 … N → A ⁡ k ⁢ z ‾ k ‾ = * ∘ A ⁡ k ⁢ z k
47 46 sumeq2dv ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ → ∑ k = 0 N A ⁡ k ⁢ z ‾ k ‾ = ∑ k = 0 N * ∘ A ⁡ k ⁢ z k
48 35 47 eqtrd ⊢ F ∈ Poly ⁡ S ∧ z ∈ ℂ → ∑ k = 0 N A ⁡ k ⁢ z ‾ k ‾ = ∑ k = 0 N * ∘ A ⁡ k ⁢ z k
49 48 mpteq2dva ⊢ F ∈ Poly ⁡ S → z ∈ ℂ ⟼ ∑ k = 0 N A ⁡ k ⁢ z ‾ k ‾ = z ∈ ℂ ⟼ ∑ k = 0 N * ∘ A ⁡ k ⁢ z k
50 28 49 eqtrd ⊢ F ∈ Poly ⁡ S → G = z ∈ ℂ ⟼ ∑ k = 0 N * ∘ A ⁡ k ⁢ z k