Metamath Proof Explorer


Theorem coe1termlem

Description: The coefficient function of a monomial. (Contributed by Mario Carneiro, 26-Jul-2014) (Revised by Mario Carneiro, 23-Aug-2014)

Ref Expression
Hypothesis coe1term.1 ⊢ F = z ∈ ℂ ⟼ A ⁢ z N
Assertion coe1termlem ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → coeff ⁡ F = n ∈ ℕ 0 ⟼ if n = N A 0 ∧ A ≠ 0 → deg ⁡ F = N

Proof

Step Hyp Ref Expression
1 coe1term.1 ⊢ F = z ∈ ℂ ⟼ A ⁢ z N
2 ssid ⊢ ℂ ⊆ ℂ
3 1 ply1term ⊢ ℂ ⊆ ℂ ∧ A ∈ ℂ ∧ N ∈ ℕ 0 → F ∈ Poly ⁡ ℂ
4 2 3 mp3an1 ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → F ∈ Poly ⁡ ℂ
5 simpr ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → N ∈ ℕ 0
6 simpl ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → A ∈ ℂ
7 0cn ⊢ 0 ∈ ℂ
8 ifcl ⊢ A ∈ ℂ ∧ 0 ∈ ℂ → if n = N A 0 ∈ ℂ
9 6 7 8 sylancl ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → if n = N A 0 ∈ ℂ
10 9 adantr ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ n ∈ ℕ 0 → if n = N A 0 ∈ ℂ
11 10 fmpttd ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → n ∈ ℕ 0 ⟼ if n = N A 0 : ℕ 0 ⟶ ℂ
12 eqid ⊢ n ∈ ℕ 0 ⟼ if n = N A 0 = n ∈ ℕ 0 ⟼ if n = N A 0
13 eqeq1 ⊢ n = k → n = N ↔ k = N
14 13 ifbid ⊢ n = k → if n = N A 0 = if k = N A 0
15 simpr ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ k ∈ ℕ 0 → k ∈ ℕ 0
16 ifcl ⊢ A ∈ ℂ ∧ 0 ∈ ℂ → if k = N A 0 ∈ ℂ
17 6 7 16 sylancl ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → if k = N A 0 ∈ ℂ
18 17 adantr ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ k ∈ ℕ 0 → if k = N A 0 ∈ ℂ
19 12 14 15 18 fvmptd3 ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ k ∈ ℕ 0 → n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ k = if k = N A 0
20 19 neeq1d ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ k ∈ ℕ 0 → n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ k ≠ 0 ↔ if k = N A 0 ≠ 0
21 nn0re ⊢ N ∈ ℕ 0 → N ∈ ℝ
22 21 leidd ⊢ N ∈ ℕ 0 → N ≤ N
23 22 ad2antlr ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ k ∈ ℕ 0 → N ≤ N
24 iffalse ⊢ ¬ k = N → if k = N A 0 = 0
25 24 necon1ai ⊢ if k = N A 0 ≠ 0 → k = N
26 25 breq1d ⊢ if k = N A 0 ≠ 0 → k ≤ N ↔ N ≤ N
27 23 26 syl5ibrcom ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ k ∈ ℕ 0 → if k = N A 0 ≠ 0 → k ≤ N
28 20 27 sylbid ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ k ∈ ℕ 0 → n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ k ≠ 0 → k ≤ N
29 28 ralrimiva ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → ∀ k ∈ ℕ 0 n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ k ≠ 0 → k ≤ N
30 plyco0 ⊢ N ∈ ℕ 0 ∧ n ∈ ℕ 0 ⟼ if n = N A 0 : ℕ 0 ⟶ ℂ → n ∈ ℕ 0 ⟼ if n = N A 0 ℤ ≥ N + 1 = 0 ↔ ∀ k ∈ ℕ 0 n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ k ≠ 0 → k ≤ N
31 5 11 30 syl2anc ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → n ∈ ℕ 0 ⟼ if n = N A 0 ℤ ≥ N + 1 = 0 ↔ ∀ k ∈ ℕ 0 n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ k ≠ 0 → k ≤ N
32 29 31 mpbird ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → n ∈ ℕ 0 ⟼ if n = N A 0 ℤ ≥ N + 1 = 0
33 1 ply1termlem ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → F = z ∈ ℂ ⟼ ∑ k = 0 N if k = N A 0 ⁢ z k
34 elfznn0 ⊢ k ∈ 0 … N → k ∈ ℕ 0
35 19 oveq1d ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ k ∈ ℕ 0 → n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ k ⁢ z k = if k = N A 0 ⁢ z k
36 34 35 sylan2 ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ k ∈ 0 … N → n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ k ⁢ z k = if k = N A 0 ⁢ z k
37 36 sumeq2dv ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → ∑ k = 0 N n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ k ⁢ z k = ∑ k = 0 N if k = N A 0 ⁢ z k
38 37 mpteq2dv ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → z ∈ ℂ ⟼ ∑ k = 0 N n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ k ⁢ z k = z ∈ ℂ ⟼ ∑ k = 0 N if k = N A 0 ⁢ z k
39 33 38 eqtr4d ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → F = z ∈ ℂ ⟼ ∑ k = 0 N n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ k ⁢ z k
40 4 5 11 32 39 coeeq ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → coeff ⁡ F = n ∈ ℕ 0 ⟼ if n = N A 0
41 4 adantr ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ A ≠ 0 → F ∈ Poly ⁡ ℂ
42 5 adantr ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ A ≠ 0 → N ∈ ℕ 0
43 11 adantr ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ A ≠ 0 → n ∈ ℕ 0 ⟼ if n = N A 0 : ℕ 0 ⟶ ℂ
44 32 adantr ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ A ≠ 0 → n ∈ ℕ 0 ⟼ if n = N A 0 ℤ ≥ N + 1 = 0
45 39 adantr ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ A ≠ 0 → F = z ∈ ℂ ⟼ ∑ k = 0 N n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ k ⁢ z k
46 iftrue ⊢ n = N → if n = N A 0 = A
47 46 12 fvmptg ⊢ N ∈ ℕ 0 ∧ A ∈ ℂ → n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ N = A
48 47 ancoms ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ N = A
49 48 neeq1d ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ N ≠ 0 ↔ A ≠ 0
50 49 biimpar ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ A ≠ 0 → n ∈ ℕ 0 ⟼ if n = N A 0 ⁡ N ≠ 0
51 41 42 43 44 45 50 dgreq ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 ∧ A ≠ 0 → deg ⁡ F = N
52 51 ex ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → A ≠ 0 → deg ⁡ F = N
53 40 52 jca ⊢ A ∈ ℂ ∧ N ∈ ℕ 0 → coeff ⁡ F = n ∈ ℕ 0 ⟼ if n = N A 0 ∧ A ≠ 0 → deg ⁡ F = N