Theorem plyn0mulidp 26423

Description: Coefficients of a non-zero polynomial multiplied by the identity polynomial. (Contributed by Thierry Arnoux, 25-Sep-2018.)

Assertion

Ref	Expression
plyn0mulidp	⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → (coeff‘(𝐹 ∘f · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))

Distinct variable group:   𝑛,𝐹

Proof of Theorem plyn0mulidp

Dummy variables 𝑖 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eldifi 4086	. . . . 5 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → 𝐹 ∈ (Poly‘ℝ))
2		ax-resscn 11158	. . . . . . 7 ⊢ ℝ ⊆ ℂ
3		1re 11209	. . . . . . 7 ⊢ 1 ∈ ℝ
4		plyid 26347	. . . . . . 7 ⊢ ((ℝ ⊆ ℂ ∧ 1 ∈ ℝ) → Xp ∈ (Poly‘ℝ))
5	2, 3, 4	mp2an 704	. . . . . 6 ⊢ Xp ∈ (Poly‘ℝ)
6	5	a1i 11	. . . . 5 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → Xp ∈ (Poly‘ℝ))
7		simprl 782	. . . . . 6 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) → 𝑥 ∈ ℝ)
8		simprr 784	. . . . . 6 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) → 𝑦 ∈ ℝ)
9	7, 8	readdcld 11239	. . . . 5 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) → (𝑥 + 𝑦) ∈ ℝ)
10	7, 8	remulcld 11240	. . . . 5 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ (𝑥 ∈ ℝ ∧ 𝑦 ∈ ℝ)) → (𝑥 · 𝑦) ∈ ℝ)
11	1, 6, 9, 10	plymul 26356	. . . 4 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → (𝐹 ∘f · Xp) ∈ (Poly‘ℝ))
12		0re 11211	. . . 4 ⊢ 0 ∈ ℝ
13		eqid 2763	. . . . 5 ⊢ (coeff‘(𝐹 ∘f · Xp)) = (coeff‘(𝐹 ∘f · Xp))
14	13	coef2 26369	. . . 4 ⊢ (((𝐹 ∘f · Xp) ∈ (Poly‘ℝ) ∧ 0 ∈ ℝ) → (coeff‘(𝐹 ∘f · Xp)):ℕ0⟶ℝ)
15	11, 12, 14	sylancl 597	. . 3 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → (coeff‘(𝐹 ∘f · Xp)):ℕ0⟶ℝ)
16	15	feqmptd 6951	. 2 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → (coeff‘(𝐹 ∘f · Xp)) = (𝑛 ∈ ℕ0 ↦ ((coeff‘(𝐹 ∘f · Xp))‘𝑛)))
17		cnex 11182	. . . . . . . . 9 ⊢ ℂ ∈ V
18	17	a1i 11	. . . . . . . 8 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → ℂ ∈ V)
19		plyf 26336	. . . . . . . . 9 ⊢ (𝐹 ∈ (Poly‘ℝ) → 𝐹:ℂ⟶ℂ)
20	1, 19	syl 18	. . . . . . . 8 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → 𝐹:ℂ⟶ℂ)
21		plyf 26336	. . . . . . . . . 10 ⊢ (Xp ∈ (Poly‘ℝ) → Xp:ℂ⟶ℂ)
22	5, 21	ax-mp 5	. . . . . . . . 9 ⊢ Xp:ℂ⟶ℂ
23	22	a1i 11	. . . . . . . 8 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → Xp:ℂ⟶ℂ)
24		simprl 782	. . . . . . . . 9 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → 𝑥 ∈ ℂ)
25		simprr 784	. . . . . . . . 9 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → 𝑦 ∈ ℂ)
26	24, 25	mulcomd 11231	. . . . . . . 8 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → (𝑥 · 𝑦) = (𝑦 · 𝑥))
27	18, 20, 23, 26	caofcom 7713	. . . . . . 7 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → (𝐹 ∘f · Xp) = (Xp ∘f · 𝐹))
28	27	fveq2d 6887	. . . . . 6 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → (coeff‘(𝐹 ∘f · Xp)) = (coeff‘(Xp ∘f · 𝐹)))
29	28	fveq1d 6885	. . . . 5 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → ((coeff‘(𝐹 ∘f · Xp))‘𝑛) = ((coeff‘(Xp ∘f · 𝐹))‘𝑛))
30	29	adantr 485	. . . 4 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) → ((coeff‘(𝐹 ∘f · Xp))‘𝑛) = ((coeff‘(Xp ∘f · 𝐹))‘𝑛))
31	5	a1i 11	. . . . . 6 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) → Xp ∈ (Poly‘ℝ))
32	1	adantr 485	. . . . . 6 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) → 𝐹 ∈ (Poly‘ℝ))
33		simpr 489	. . . . . 6 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) → 𝑛 ∈ ℕ0)
34		eqid 2763	. . . . . . 7 ⊢ (coeff‘Xp) = (coeff‘Xp)
35		eqid 2763	. . . . . . 7 ⊢ (coeff‘𝐹) = (coeff‘𝐹)
36	34, 35	coemul 26390	. . . . . 6 ⊢ ((Xp ∈ (Poly‘ℝ) ∧ 𝐹 ∈ (Poly‘ℝ) ∧ 𝑛 ∈ ℕ0) → ((coeff‘(Xp ∘f · 𝐹))‘𝑛) = Σ𝑖 ∈ (0...𝑛)(((coeff‘Xp)‘𝑖) · ((coeff‘𝐹)‘(𝑛 − 𝑖))))
37	31, 32, 33, 36	syl3anc 1398	. . . . 5 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) → ((coeff‘(Xp ∘f · 𝐹))‘𝑛) = Σ𝑖 ∈ (0...𝑛)(((coeff‘Xp)‘𝑖) · ((coeff‘𝐹)‘(𝑛 − 𝑖))))
38		elfznn0 13650	. . . . . . . . . 10 ⊢ (𝑖 ∈ (0...𝑛) → 𝑖 ∈ ℕ0)
39		coeidp 26401	. . . . . . . . . 10 ⊢ (𝑖 ∈ ℕ0 → ((coeff‘Xp)‘𝑖) = if(𝑖 = 1, 1, 0))
40	38, 39	syl 18	. . . . . . . . 9 ⊢ (𝑖 ∈ (0...𝑛) → ((coeff‘Xp)‘𝑖) = if(𝑖 = 1, 1, 0))
41	40	oveq1d 7427	. . . . . . . 8 ⊢ (𝑖 ∈ (0...𝑛) → (((coeff‘Xp)‘𝑖) · ((coeff‘𝐹)‘(𝑛 − 𝑖))) = (if(𝑖 = 1, 1, 0) · ((coeff‘𝐹)‘(𝑛 − 𝑖))))
42		ovif 7510	. . . . . . . 8 ⊢ (if(𝑖 = 1, 1, 0) · ((coeff‘𝐹)‘(𝑛 − 𝑖))) = if(𝑖 = 1, (1 · ((coeff‘𝐹)‘(𝑛 − 𝑖))), (0 · ((coeff‘𝐹)‘(𝑛 − 𝑖))))
43	41, 42	eqtrdi 2814	. . . . . . 7 ⊢ (𝑖 ∈ (0...𝑛) → (((coeff‘Xp)‘𝑖) · ((coeff‘𝐹)‘(𝑛 − 𝑖))) = if(𝑖 = 1, (1 · ((coeff‘𝐹)‘(𝑛 − 𝑖))), (0 · ((coeff‘𝐹)‘(𝑛 − 𝑖)))))
44	43	adantl 486	. . . . . 6 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ 𝑖 ∈ (0...𝑛)) → (((coeff‘Xp)‘𝑖) · ((coeff‘𝐹)‘(𝑛 − 𝑖))) = if(𝑖 = 1, (1 · ((coeff‘𝐹)‘(𝑛 − 𝑖))), (0 · ((coeff‘𝐹)‘(𝑛 − 𝑖)))))
45	44	sumeq2dv 15755	. . . . 5 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) → Σ𝑖 ∈ (0...𝑛)(((coeff‘Xp)‘𝑖) · ((coeff‘𝐹)‘(𝑛 − 𝑖))) = Σ𝑖 ∈ (0...𝑛)if(𝑖 = 1, (1 · ((coeff‘𝐹)‘(𝑛 − 𝑖))), (0 · ((coeff‘𝐹)‘(𝑛 − 𝑖)))))
46		velsn 4606	. . . . . . . . . 10 ⊢ (𝑖 ∈ {1} ↔ 𝑖 = 1)
47	46	bicomi 227	. . . . . . . . 9 ⊢ (𝑖 = 1 ↔ 𝑖 ∈ {1})
48	47	a1i 11	. . . . . . . 8 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ 𝑖 ∈ (0...𝑛)) → (𝑖 = 1 ↔ 𝑖 ∈ {1}))
49	35	coef2 26369	. . . . . . . . . . . . 13 ⊢ ((𝐹 ∈ (Poly‘ℝ) ∧ 0 ∈ ℝ) → (coeff‘𝐹):ℕ0⟶ℝ)
50	1, 12, 49	sylancl 597	. . . . . . . . . . . 12 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → (coeff‘𝐹):ℕ0⟶ℝ)
51	50	ad2antrr 738	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ 𝑖 ∈ (0...𝑛)) → (coeff‘𝐹):ℕ0⟶ℝ)
52		fznn0sub 13586	. . . . . . . . . . . 12 ⊢ (𝑖 ∈ (0...𝑛) → (𝑛 − 𝑖) ∈ ℕ0)
53	52	adantl 486	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ 𝑖 ∈ (0...𝑛)) → (𝑛 − 𝑖) ∈ ℕ0)
54	51, 53	ffvelcdmd 7082	. . . . . . . . . 10 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ 𝑖 ∈ (0...𝑛)) → ((coeff‘𝐹)‘(𝑛 − 𝑖)) ∈ ℝ)
55	54	recnd 11238	. . . . . . . . 9 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ 𝑖 ∈ (0...𝑛)) → ((coeff‘𝐹)‘(𝑛 − 𝑖)) ∈ ℂ)
56	55	mullidd 11228	. . . . . . . 8 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ 𝑖 ∈ (0...𝑛)) → (1 · ((coeff‘𝐹)‘(𝑛 − 𝑖))) = ((coeff‘𝐹)‘(𝑛 − 𝑖)))
57	55	mul02d 11409	. . . . . . . 8 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ 𝑖 ∈ (0...𝑛)) → (0 · ((coeff‘𝐹)‘(𝑛 − 𝑖))) = 0)
58	48, 56, 57	ifbieq12d 4517	. . . . . . 7 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ 𝑖 ∈ (0...𝑛)) → if(𝑖 = 1, (1 · ((coeff‘𝐹)‘(𝑛 − 𝑖))), (0 · ((coeff‘𝐹)‘(𝑛 − 𝑖)))) = if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0))
59	58	sumeq2dv 15755	. . . . . 6 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) → Σ𝑖 ∈ (0...𝑛)if(𝑖 = 1, (1 · ((coeff‘𝐹)‘(𝑛 − 𝑖))), (0 · ((coeff‘𝐹)‘(𝑛 − 𝑖)))) = Σ𝑖 ∈ (0...𝑛)if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0))
60		eqeq2 2775	. . . . . . 7 ⊢ (0 = if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1))) → (Σ𝑖 ∈ (0...𝑛)if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0) = 0 ↔ Σ𝑖 ∈ (0...𝑛)if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0) = if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
61		eqeq2 2775	. . . . . . 7 ⊢ (((coeff‘𝐹)‘(𝑛 − 1)) = if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1))) → (Σ𝑖 ∈ (0...𝑛)if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0) = ((coeff‘𝐹)‘(𝑛 − 1)) ↔ Σ𝑖 ∈ (0...𝑛)if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0) = if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
62		oveq2 7420	. . . . . . . . . . 11 ⊢ (𝑛 = 0 → (0...𝑛) = (0...0))
63		0z 12603	. . . . . . . . . . . 12 ⊢ 0 ∈ ℤ
64		fzsn 13596	. . . . . . . . . . . 12 ⊢ (0 ∈ ℤ → (0...0) = {0})
65	63, 64	ax-mp 5	. . . . . . . . . . 11 ⊢ (0...0) = {0}
66	62, 65	eqtrdi 2814	. . . . . . . . . 10 ⊢ (𝑛 = 0 → (0...𝑛) = {0})
67		elsni 4607	. . . . . . . . . . . 12 ⊢ (𝑖 ∈ {0} → 𝑖 = 0)
68	67	adantl 486	. . . . . . . . . . 11 ⊢ ((𝑛 = 0 ∧ 𝑖 ∈ {0}) → 𝑖 = 0)
69		ax-1ne0 11170	. . . . . . . . . . . . 13 ⊢ 1 ≠ 0
70	69	nesymi 3015	. . . . . . . . . . . 12 ⊢ ¬ 0 = 1
71		eqeq1 2767	. . . . . . . . . . . 12 ⊢ (𝑖 = 0 → (𝑖 = 1 ↔ 0 = 1))
72	70, 71	mtbiri 330	. . . . . . . . . . 11 ⊢ (𝑖 = 0 → ¬ 𝑖 = 1)
73	47	notbii 323	. . . . . . . . . . . 12 ⊢ (¬ 𝑖 = 1 ↔ ¬ 𝑖 ∈ {1})
74	73	biimpi 219	. . . . . . . . . . 11 ⊢ (¬ 𝑖 = 1 → ¬ 𝑖 ∈ {1})
75		iffalse 4497	. . . . . . . . . . 11 ⊢ (¬ 𝑖 ∈ {1} → if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0) = 0)
76	68, 72, 74, 75	4syl 20	. . . . . . . . . 10 ⊢ ((𝑛 = 0 ∧ 𝑖 ∈ {0}) → if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0) = 0)
77	66, 76	sumeq12rdv 15760	. . . . . . . . 9 ⊢ (𝑛 = 0 → Σ𝑖 ∈ (0...𝑛)if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0) = Σ𝑖 ∈ {0}0)
78		snfi 9041	. . . . . . . . . . 11 ⊢ {0} ∈ Fin
79	78	olci 879	. . . . . . . . . 10 ⊢ ({0} ⊆ (ℤ≥‘0) ∨ {0} ∈ Fin)
80		sumz 15775	. . . . . . . . . 10 ⊢ (({0} ⊆ (ℤ≥‘0) ∨ {0} ∈ Fin) → Σ𝑖 ∈ {0}0 = 0)
81	79, 80	ax-mp 5	. . . . . . . . 9 ⊢ Σ𝑖 ∈ {0}0 = 0
82	77, 81	eqtrdi 2814	. . . . . . . 8 ⊢ (𝑛 = 0 → Σ𝑖 ∈ (0...𝑛)if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0) = 0)
83	82	adantl 486	. . . . . . 7 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ 𝑛 = 0) → Σ𝑖 ∈ (0...𝑛)if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0) = 0)
84		simpll 778	. . . . . . . 8 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ ¬ 𝑛 = 0) → 𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}))
85	33	adantr 485	. . . . . . . . 9 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ ¬ 𝑛 = 0) → 𝑛 ∈ ℕ0)
86		simpr 489	. . . . . . . . . 10 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ ¬ 𝑛 = 0) → ¬ 𝑛 = 0)
87	86	neqned 2965	. . . . . . . . 9 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ ¬ 𝑛 = 0) → 𝑛 ≠ 0)
88		elnnne0 12519	. . . . . . . . 9 ⊢ (𝑛 ∈ ℕ ↔ (𝑛 ∈ ℕ0 ∧ 𝑛 ≠ 0))
89	85, 87, 88	sylanbrc 594	. . . . . . . 8 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ ¬ 𝑛 = 0) → 𝑛 ∈ ℕ)
90		1nn0 12521	. . . . . . . . . . . . 13 ⊢ 1 ∈ ℕ0
91	90	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → 1 ∈ ℕ0)
92		simpr 489	. . . . . . . . . . . . 13 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℕ)
93	92	nnnn0d 12566	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → 𝑛 ∈ ℕ0)
94	92	nnge1d 12285	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → 1 ≤ 𝑛)
95		elfz2nn0 13648	. . . . . . . . . . . 12 ⊢ (1 ∈ (0...𝑛) ↔ (1 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0 ∧ 1 ≤ 𝑛))
96	91, 93, 94, 95	syl3anbrc 1362	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → 1 ∈ (0...𝑛))
97	96	snssd 4753	. . . . . . . . . 10 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → {1} ⊆ (0...𝑛))
98	50	ad2antrr 738	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) ∧ 𝑖 ∈ {1}) → (coeff‘𝐹):ℕ0⟶ℝ)
99		oveq2 7420	. . . . . . . . . . . . . . . 16 ⊢ (𝑖 = 1 → (𝑛 − 𝑖) = (𝑛 − 1))
100	46, 99	sylbi 220	. . . . . . . . . . . . . . 15 ⊢ (𝑖 ∈ {1} → (𝑛 − 𝑖) = (𝑛 − 1))
101	100	adantl 486	. . . . . . . . . . . . . 14 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) ∧ 𝑖 ∈ {1}) → (𝑛 − 𝑖) = (𝑛 − 1))
102		nnm1nn0 12546	. . . . . . . . . . . . . . 15 ⊢ (𝑛 ∈ ℕ → (𝑛 − 1) ∈ ℕ0)
103	102	ad2antlr 739	. . . . . . . . . . . . . 14 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) ∧ 𝑖 ∈ {1}) → (𝑛 − 1) ∈ ℕ0)
104	101, 103	eqeltrd 2863	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) ∧ 𝑖 ∈ {1}) → (𝑛 − 𝑖) ∈ ℕ0)
105	98, 104	ffvelcdmd 7082	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) ∧ 𝑖 ∈ {1}) → ((coeff‘𝐹)‘(𝑛 − 𝑖)) ∈ ℝ)
106	105	recnd 11238	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) ∧ 𝑖 ∈ {1}) → ((coeff‘𝐹)‘(𝑛 − 𝑖)) ∈ ℂ)
107	106	ralrimiva 3157	. . . . . . . . . 10 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → ∀𝑖 ∈ {1} ((coeff‘𝐹)‘(𝑛 − 𝑖)) ∈ ℂ)
108		fzfi 14010	. . . . . . . . . . . 12 ⊢ (0...𝑛) ∈ Fin
109	108	olci 879	. . . . . . . . . . 11 ⊢ ((0...𝑛) ⊆ (ℤ≥‘0) ∨ (0...𝑛) ∈ Fin)
110	109	a1i 11	. . . . . . . . . 10 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → ((0...𝑛) ⊆ (ℤ≥‘0) ∨ (0...𝑛) ∈ Fin))
111		sumss2 15779	. . . . . . . . . 10 ⊢ ((({1} ⊆ (0...𝑛) ∧ ∀𝑖 ∈ {1} ((coeff‘𝐹)‘(𝑛 − 𝑖)) ∈ ℂ) ∧ ((0...𝑛) ⊆ (ℤ≥‘0) ∨ (0...𝑛) ∈ Fin)) → Σ𝑖 ∈ {1} ((coeff‘𝐹)‘(𝑛 − 𝑖)) = Σ𝑖 ∈ (0...𝑛)if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0))
112	97, 107, 110, 111	syl21anc 850	. . . . . . . . 9 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → Σ𝑖 ∈ {1} ((coeff‘𝐹)‘(𝑛 − 𝑖)) = Σ𝑖 ∈ (0...𝑛)if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0))
113	50	adantr 485	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → (coeff‘𝐹):ℕ0⟶ℝ)
114	102	adantl 486	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → (𝑛 − 1) ∈ ℕ0)
115	113, 114	ffvelcdmd 7082	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → ((coeff‘𝐹)‘(𝑛 − 1)) ∈ ℝ)
116	115	recnd 11238	. . . . . . . . . 10 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → ((coeff‘𝐹)‘(𝑛 − 1)) ∈ ℂ)
117	99	fveq2d 6887	. . . . . . . . . . 11 ⊢ (𝑖 = 1 → ((coeff‘𝐹)‘(𝑛 − 𝑖)) = ((coeff‘𝐹)‘(𝑛 − 1)))
118	117	sumsn 15799	. . . . . . . . . 10 ⊢ ((1 ∈ ℝ ∧ ((coeff‘𝐹)‘(𝑛 − 1)) ∈ ℂ) → Σ𝑖 ∈ {1} ((coeff‘𝐹)‘(𝑛 − 𝑖)) = ((coeff‘𝐹)‘(𝑛 − 1)))
119	3, 116, 118	sylancr 598	. . . . . . . . 9 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → Σ𝑖 ∈ {1} ((coeff‘𝐹)‘(𝑛 − 𝑖)) = ((coeff‘𝐹)‘(𝑛 − 1)))
120	112, 119	eqtr3d 2800	. . . . . . . 8 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ) → Σ𝑖 ∈ (0...𝑛)if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0) = ((coeff‘𝐹)‘(𝑛 − 1)))
121	84, 89, 120	syl2anc 595	. . . . . . 7 ⊢ (((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) ∧ ¬ 𝑛 = 0) → Σ𝑖 ∈ (0...𝑛)if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0) = ((coeff‘𝐹)‘(𝑛 − 1)))
122	60, 61, 83, 121	ifbothda 4527	. . . . . 6 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) → Σ𝑖 ∈ (0...𝑛)if(𝑖 ∈ {1}, ((coeff‘𝐹)‘(𝑛 − 𝑖)), 0) = if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1))))
123	59, 122	eqtrd 2798	. . . . 5 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) → Σ𝑖 ∈ (0...𝑛)if(𝑖 = 1, (1 · ((coeff‘𝐹)‘(𝑛 − 𝑖))), (0 · ((coeff‘𝐹)‘(𝑛 − 𝑖)))) = if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1))))
124	37, 45, 123	3eqtrd 2802	. . . 4 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) → ((coeff‘(Xp ∘f · 𝐹))‘𝑛) = if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1))))
125	30, 124	eqtrd 2798	. . 3 ⊢ ((𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) ∧ 𝑛 ∈ ℕ0) → ((coeff‘(𝐹 ∘f · Xp))‘𝑛) = if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1))))
126	125	mpteq2dva 5205	. 2 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → (𝑛 ∈ ℕ0 ↦ ((coeff‘(𝐹 ∘f · Xp))‘𝑛)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))
127	16, 126	eqtrd 2798	1 ⊢ (𝐹 ∈ ((Poly‘ℝ) ∖ {0𝑝}) → (coeff‘(𝐹 ∘f · Xp)) = (𝑛 ∈ ℕ0 ↦ if(𝑛 = 0, 0, ((coeff‘𝐹)‘(𝑛 − 1)))))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   = wceq 1570   ∈ wcel 2143   ≠ wne 2958  ∀wral 3079  Vcvv 3455   ∖ cdif 3903   ⊆ wss 3906  ifcif 4488  {csn 4590   class class class wbr 5110   ↦ cmpt 5193  ⟶wf 6534  ‘cfv 6538  (class class class)co 7412   ∘_f cof 7674  Fincfn 8944  ℂcc 11099  ℝcr 11100  0cc0 11101  1c1 11102   · cmul 11106   ≤ cle 11245   − cmin 11442  ℕcn 12234  ℕ₀cn0 12505  ℤcz 12592  ℤ_≥cuz 12863  ...cfz 13536  Σcsu 15739  0_𝑝c0p 25809  Polycply 26322  X_pcidp 26323  coeffccoe 26324

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734  ax-inf2 9611  ax-cnex 11157  ax-resscn 11158  ax-1cn 11159  ax-icn 11160  ax-addcl 11161  ax-addrcl 11162  ax-mulcl 11163  ax-mulrcl 11164  ax-mulcom 11165  ax-addass 11166  ax-mulass 11167  ax-distr 11168  ax-i2m1 11169  ax-1ne0 11170  ax-1rid 11171  ax-rnegex 11172  ax-rrecex 11173  ax-cnre 11174  ax-pre-lttri 11175  ax-pre-lttrn 11176  ax-pre-ltadd 11177  ax-pre-mulgt0 11178  ax-pre-sup 11179

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-of 7676  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-rdg 8398  df-1o 8454  df-er 8695  df-map 8827  df-pm 8828  df-en 8945  df-dom 8946  df-sdom 8947  df-fin 8948  df-sup 9403  df-inf 9404  df-oi 9473  df-card 9926  df-pnf 11246  df-mnf 11247  df-xr 11248  df-ltxr 11249  df-le 11250  df-sub 11444  df-neg 11445  df-div 11873  df-nn 12235  df-2 12304  df-3 12305  df-n0 12506  df-z 12593  df-uz 12864  df-rp 13018  df-fz 13537  df-fzo 13685  df-fl 13827  df-seq 14040  df-exp 14100  df-hash 14369  df-cj 15152  df-re 15153  df-im 15154  df-sqrt 15288  df-abs 15289  df-clim 15541  df-rlim 15542  df-sum 15740  df-0p 25810  df-ply 26326  df-idp 26327  df-coe 26328  df-dgr 26329

This theorem is referenced by:  plymulidp  26424