Theorem coe1termlem 26376

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

Hypothesis

Ref	Expression
coe1term.1	⊢ 𝐹 = (𝑧 ∈ ℂ ↦ (𝐴 · (𝑧↑𝑁)))

Assertion

Ref	Expression
coe1termlem	⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((coeff‘𝐹) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0)) ∧ (𝐴 ≠ 0 → (deg‘𝐹) = 𝑁)))

Distinct variable groups:   𝑧,𝑛,𝐴   𝑛,𝑁,𝑧

Allowed substitution hints:   𝐹(𝑧,𝑛)

Proof of Theorem coe1termlem

Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ssid 3961	. . . 4 ⊢ ℂ ⊆ ℂ
2		coe1term.1	. . . . 5 ⊢ 𝐹 = (𝑧 ∈ ℂ ↦ (𝐴 · (𝑧↑𝑁)))
3	2	ply1term 26322	. . . 4 ⊢ ((ℂ ⊆ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → 𝐹 ∈ (Poly‘ℂ))
4	1, 3	mp3an1 1472	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → 𝐹 ∈ (Poly‘ℂ))
5		simpr 489	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → 𝑁 ∈ ℕ0)
6		simpl 487	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → 𝐴 ∈ ℂ)
7		0cn 11186	. . . . . 6 ⊢ 0 ∈ ℂ
8		ifcl 4529	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 0 ∈ ℂ) → if(𝑛 = 𝑁, 𝐴, 0) ∈ ℂ)
9	6, 7, 8	sylancl 597	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → if(𝑛 = 𝑁, 𝐴, 0) ∈ ℂ)
10	9	adantr 485	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑛 ∈ ℕ0) → if(𝑛 = 𝑁, 𝐴, 0) ∈ ℂ)
11	10	fmpttd 7100	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0)):ℕ0⟶ℂ)
12		eqid 2765	. . . . . . . 8 ⊢ (𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))
13		eqeq1 2769	. . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (𝑛 = 𝑁 ↔ 𝑘 = 𝑁))
14	13	ifbid 4507	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → if(𝑛 = 𝑁, 𝐴, 0) = if(𝑘 = 𝑁, 𝐴, 0))
15		simpr 489	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℕ0) → 𝑘 ∈ ℕ0)
16		ifcl 4529	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℂ ∧ 0 ∈ ℂ) → if(𝑘 = 𝑁, 𝐴, 0) ∈ ℂ)
17	6, 7, 16	sylancl 597	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → if(𝑘 = 𝑁, 𝐴, 0) ∈ ℂ)
18	17	adantr 485	. . . . . . . 8 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℕ0) → if(𝑘 = 𝑁, 𝐴, 0) ∈ ℂ)
19	12, 14, 15, 18	fvmptd3 7003	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℕ0) → ((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑘) = if(𝑘 = 𝑁, 𝐴, 0))
20	19	neeq1d 3019	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℕ0) → (((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑘) ≠ 0 ↔ if(𝑘 = 𝑁, 𝐴, 0) ≠ 0))
21		nn0re 12504	. . . . . . . . 9 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ∈ ℝ)
22	21	leidd 11768	. . . . . . . 8 ⊢ (𝑁 ∈ ℕ0 → 𝑁 ≤ 𝑁)
23	22	ad2antlr 739	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℕ0) → 𝑁 ≤ 𝑁)
24		iffalse 4492	. . . . . . . . 9 ⊢ (¬ 𝑘 = 𝑁 → if(𝑘 = 𝑁, 𝐴, 0) = 0)
25	24	necon1ai 2987	. . . . . . . 8 ⊢ (if(𝑘 = 𝑁, 𝐴, 0) ≠ 0 → 𝑘 = 𝑁)
26	25	breq1d 5115	. . . . . . 7 ⊢ (if(𝑘 = 𝑁, 𝐴, 0) ≠ 0 → (𝑘 ≤ 𝑁 ↔ 𝑁 ≤ 𝑁))
27	23, 26	syl5ibrcom 250	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℕ0) → (if(𝑘 = 𝑁, 𝐴, 0) ≠ 0 → 𝑘 ≤ 𝑁))
28	20, 27	sylbid 243	. . . . 5 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℕ0) → (((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁))
29	28	ralrimiva 3157	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ∀𝑘 ∈ ℕ0 (((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁))
30		plyco0 26310	. . . . 5 ⊢ ((𝑁 ∈ ℕ0 ∧ (𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0)):ℕ0⟶ℂ) → (((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0)) “ (ℤ≥‘(𝑁 + 1))) = {0} ↔ ∀𝑘 ∈ ℕ0 (((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)))
31	5, 11, 30	syl2anc 595	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0)) “ (ℤ≥‘(𝑁 + 1))) = {0} ↔ ∀𝑘 ∈ ℕ0 (((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)))
32	29, 31	mpbird 260	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0)) “ (ℤ≥‘(𝑁 + 1))) = {0})
33	2	ply1termlem 26321	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)(if(𝑘 = 𝑁, 𝐴, 0) · (𝑧↑𝑘))))
34		elfznn0 13639	. . . . . . 7 ⊢ (𝑘 ∈ (0...𝑁) → 𝑘 ∈ ℕ0)
35	19	oveq1d 7415	. . . . . . 7 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ ℕ0) → (((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑘) · (𝑧↑𝑘)) = (if(𝑘 = 𝑁, 𝐴, 0) · (𝑧↑𝑘)))
36	34, 35	sylan2 604	. . . . . 6 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝑘 ∈ (0...𝑁)) → (((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑘) · (𝑧↑𝑘)) = (if(𝑘 = 𝑁, 𝐴, 0) · (𝑧↑𝑘)))
37	36	sumeq2dv 15743	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → Σ𝑘 ∈ (0...𝑁)(((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...𝑁)(if(𝑘 = 𝑁, 𝐴, 0) · (𝑧↑𝑘)))
38	37	mpteq2dv 5199	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)(((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)(if(𝑘 = 𝑁, 𝐴, 0) · (𝑧↑𝑘))))
39	33, 38	eqtr4d 2803	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)(((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑘) · (𝑧↑𝑘))))
40	4, 5, 11, 32, 39	coeeq 26345	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (coeff‘𝐹) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0)))
41	4	adantr 485	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ≠ 0) → 𝐹 ∈ (Poly‘ℂ))
42	5	adantr 485	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ≠ 0) → 𝑁 ∈ ℕ0)
43	11	adantr 485	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ≠ 0) → (𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0)):ℕ0⟶ℂ)
44	32	adantr 485	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ≠ 0) → ((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0)) “ (ℤ≥‘(𝑁 + 1))) = {0})
45	39	adantr 485	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ≠ 0) → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)(((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑘) · (𝑧↑𝑘))))
46		iftrue 4489	. . . . . . . 8 ⊢ (𝑛 = 𝑁 → if(𝑛 = 𝑁, 𝐴, 0) = 𝐴)
47	46, 12	fvmptg 6977	. . . . . . 7 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴 ∈ ℂ) → ((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑁) = 𝐴)
48	47	ancoms 463	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑁) = 𝐴)
49	48	neeq1d 3019	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑁) ≠ 0 ↔ 𝐴 ≠ 0))
50	49	biimpar 482	. . . 4 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ≠ 0) → ((𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0))‘𝑁) ≠ 0)
51	41, 42, 43, 44, 45, 50	dgreq 26362	. . 3 ⊢ (((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) ∧ 𝐴 ≠ 0) → (deg‘𝐹) = 𝑁)
52	51	ex 417	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → (𝐴 ≠ 0 → (deg‘𝐹) = 𝑁))
53	40, 52	jca 520	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝑁 ∈ ℕ0) → ((coeff‘𝐹) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 𝑁, 𝐴, 0)) ∧ (𝐴 ≠ 0 → (deg‘𝐹) = 𝑁)))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   = wceq 1563   ∈ wcel 2145   ≠ wne 2960  ∀wral 3079   ⊆ wss 3907  ifcif 4483  {csn 4585   class class class wbr 5105   ↦ cmpt 5186   “ cima 5655  ⟶wf 6521  ‘cfv 6525  (class class class)co 7400  ℂcc 11086  0cc0 11088  1c1 11089   + caddc 11091   · cmul 11093   ≤ cle 11232  ℕ₀cn0 12495  ℤ_≥cuz 12853  ...cfz 13526  ↑cexp 14088  Σcsu 15727  Polycply 26302  coeffccoe 26304  degcdgr 26305

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5232  ax-sep 5251  ax-nul 5261  ax-pow 5327  ax-pr 5395  ax-un 7722  ax-inf2 9598  ax-cnex 11144  ax-resscn 11145  ax-1cn 11146  ax-icn 11147  ax-addcl 11148  ax-addrcl 11149  ax-mulcl 11150  ax-mulrcl 11151  ax-mulcom 11152  ax-addass 11153  ax-mulass 11154  ax-distr 11155  ax-i2m1 11156  ax-1ne0 11157  ax-1rid 11158  ax-rnegex 11159  ax-rrecex 11160  ax-cnre 11161  ax-pre-lttri 11162  ax-pre-lttrn 11163  ax-pre-ltadd 11164  ax-pre-mulgt0 11165  ax-pre-sup 11166

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-int 4909  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5547  df-eprel 5552  df-po 5560  df-so 5561  df-fr 5605  df-se 5606  df-we 5607  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-pred 6292  df-ord 6353  df-on 6354  df-lim 6355  df-suc 6356  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-isom 6534  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-of 7664  df-om 7851  df-1st 7974  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-1o 8441  df-er 8682  df-map 8814  df-pm 8815  df-en 8932  df-dom 8933  df-sdom 8934  df-fin 8935  df-sup 9390  df-inf 9391  df-oi 9460  df-card 9913  df-pnf 11233  df-mnf 11234  df-xr 11235  df-ltxr 11236  df-le 11237  df-sub 11431  df-neg 11432  df-div 11860  df-nn 12225  df-2 12294  df-3 12295  df-n0 12496  df-z 12583  df-uz 12854  df-rp 13008  df-fz 13527  df-fzo 13674  df-fl 13816  df-seq 14029  df-exp 14089  df-hash 14358  df-cj 15140  df-re 15141  df-im 15142  df-sqrt 15276  df-abs 15277  df-clim 15529  df-rlim 15530  df-sum 15728  df-0p 25790  df-ply 26306  df-coe 26308  df-dgr 26309

This theorem is referenced by:  coe1term  26377  dgr1term  26378