coemullem - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > coemullem		Structured version Visualization version GIF version

Theorem coemullem 26205

Description: Lemma for coemul 26207 and dgrmul 26226. (Contributed by Mario Carneiro, 24-Jul-2014.)

**Hypotheses**
Ref	Expression
coefv0.1	⊢ 𝐴 = (coeff‘𝐹)
coeadd.2	⊢ 𝐵 = (coeff‘𝐺)
coeadd.3	⊢ 𝑀 = (deg‘𝐹)
coeadd.4	⊢ 𝑁 = (deg‘𝐺)

**Assertion**
Ref	Expression
coemullem	⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘(𝐹 ∘_f · 𝐺)) = (𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))) ∧ (deg‘(𝐹 ∘_f · 𝐺)) ≤ (𝑀 + 𝑁)))

Distinct variable groups: 𝑘,𝑛,𝐴 𝐵,𝑘,𝑛 𝑘,𝐹,𝑛 𝑘,𝑀 𝑘,𝐺,𝑛 𝑘,𝑁,𝑛 𝑆,𝑘,𝑛 Allowed substitution hint: 𝑀(𝑛)

Proof of Theorem coemullem Dummy variables 𝑗 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		plymulcl 26176	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 ∘_f · 𝐺) ∈ (Poly‘ℂ))
2		coeadd.3	. . . . 5 ⊢ 𝑀 = (deg‘𝐹)
3		dgrcl 26188	. . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ₀)
4	2, 3	eqeltrid 2838	. . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑀 ∈ ℕ₀)
5		coeadd.4	. . . . 5 ⊢ 𝑁 = (deg‘𝐺)
6		dgrcl 26188	. . . . 5 ⊢ (𝐺 ∈ (Poly‘𝑆) → (deg‘𝐺) ∈ ℕ₀)
7	5, 6	eqeltrid 2838	. . . 4 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝑁 ∈ ℕ₀)
8		nn0addcl 12534	. . . 4 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑀 + 𝑁) ∈ ℕ₀)
9	4, 7, 8	syl2an 596	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝑀 + 𝑁) ∈ ℕ₀)
10		fzfid 13989	. . . . 5 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) → (0...𝑛) ∈ Fin)
11		coefv0.1	. . . . . . . . . 10 ⊢ 𝐴 = (coeff‘𝐹)
12	11	coef3 26187	. . . . . . . . 9 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐴:ℕ₀⟶ℂ)
13	12	adantr 480	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐴:ℕ₀⟶ℂ)
14	13	adantr 480	. . . . . . 7 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) → 𝐴:ℕ₀⟶ℂ)
15		elfznn0 13635	. . . . . . 7 ⊢ (𝑘 ∈ (0...𝑛) → 𝑘 ∈ ℕ₀)
16		ffvelcdm 7070	. . . . . . 7 ⊢ ((𝐴:ℕ₀⟶ℂ ∧ 𝑘 ∈ ℕ₀) → (𝐴‘𝑘) ∈ ℂ)
17	14, 15, 16	syl2an 596	. . . . . 6 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑛)) → (𝐴‘𝑘) ∈ ℂ)
18		coeadd.2	. . . . . . . . . 10 ⊢ 𝐵 = (coeff‘𝐺)
19	18	coef3 26187	. . . . . . . . 9 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝐵:ℕ₀⟶ℂ)
20	19	adantl 481	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐵:ℕ₀⟶ℂ)
21	20	ad2antrr 726	. . . . . . 7 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑛)) → 𝐵:ℕ₀⟶ℂ)
22		fznn0sub 13571	. . . . . . . 8 ⊢ (𝑘 ∈ (0...𝑛) → (𝑛 − 𝑘) ∈ ℕ₀)
23	22	adantl 481	. . . . . . 7 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑛)) → (𝑛 − 𝑘) ∈ ℕ₀)
24	21, 23	ffvelcdmd 7074	. . . . . 6 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑛)) → (𝐵‘(𝑛 − 𝑘)) ∈ ℂ)
25	17, 24	mulcld 11253	. . . . 5 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑛)) → ((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))) ∈ ℂ)
26	10, 25	fsumcl 15747	. . . 4 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) → Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))) ∈ ℂ)
27	26	fmpttd 7104	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))):ℕ₀⟶ℂ)
28		oveq2 7411	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑗 → (0...𝑛) = (0...𝑗))
29		fvoveq1 7426	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑗 → (𝐵‘(𝑛 − 𝑘)) = (𝐵‘(𝑗 − 𝑘)))
30	29	oveq2d 7419	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑗 → ((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))) = ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))))
31	30	adantr 480	. . . . . . . . . . 11 ⊢ ((𝑛 = 𝑗 ∧ 𝑘 ∈ (0...𝑛)) → ((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))) = ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))))
32	28, 31	sumeq12dv 15720	. . . . . . . . . 10 ⊢ (𝑛 = 𝑗 → Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))) = Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))))
33		eqid 2735	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))) = (𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))
34		sumex 15702	. . . . . . . . . 10 ⊢ Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) ∈ V
35	32, 33, 34	fvmpt 6985	. . . . . . . . 9 ⊢ (𝑗 ∈ ℕ₀ → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) = Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))))
36	35	ad2antrl 728	. . . . . . . 8 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) = Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))))
37		simp2r 1201	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ¬ 𝑗 ≤ (𝑀 + 𝑁))
38		simp2l 1200	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑗 ∈ ℕ₀)
39	38	nn0red 12561	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑗 ∈ ℝ)
40		simp3l 1202	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑘 ∈ (0...𝑗))
41		elfznn0 13635	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑘 ∈ (0...𝑗) → 𝑘 ∈ ℕ₀)
42	40, 41	syl 17	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑘 ∈ ℕ₀)
43	42	nn0red 12561	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑘 ∈ ℝ)
44	7	adantl 481	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝑁 ∈ ℕ₀)
45	44	3ad2ant1 1133	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑁 ∈ ℕ₀)
46	45	nn0red 12561	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑁 ∈ ℝ)
47	39, 43, 46	lesubadd2d 11834	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝑗 − 𝑘) ≤ 𝑁 ↔ 𝑗 ≤ (𝑘 + 𝑁)))
48	4	adantr 480	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝑀 ∈ ℕ₀)
49	48	3ad2ant1 1133	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑀 ∈ ℕ₀)
50	49	nn0red 12561	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑀 ∈ ℝ)
51		simp3r 1203	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑘 ≤ 𝑀)
52	43, 50, 46, 51	leadd1dd 11849	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝑘 + 𝑁) ≤ (𝑀 + 𝑁))
53	43, 46	readdcld 11262	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝑘 + 𝑁) ∈ ℝ)
54	50, 46	readdcld 11262	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝑀 + 𝑁) ∈ ℝ)
55		letr 11327	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑗 ∈ ℝ ∧ (𝑘 + 𝑁) ∈ ℝ ∧ (𝑀 + 𝑁) ∈ ℝ) → ((𝑗 ≤ (𝑘 + 𝑁) ∧ (𝑘 + 𝑁) ≤ (𝑀 + 𝑁)) → 𝑗 ≤ (𝑀 + 𝑁)))
56	39, 53, 54, 55	syl3anc 1373	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝑗 ≤ (𝑘 + 𝑁) ∧ (𝑘 + 𝑁) ≤ (𝑀 + 𝑁)) → 𝑗 ≤ (𝑀 + 𝑁)))
57	52, 56	mpan2d 694	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝑗 ≤ (𝑘 + 𝑁) → 𝑗 ≤ (𝑀 + 𝑁)))
58	47, 57	sylbid 240	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝑗 − 𝑘) ≤ 𝑁 → 𝑗 ≤ (𝑀 + 𝑁)))
59	37, 58	mtod 198	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ¬ (𝑗 − 𝑘) ≤ 𝑁)
60		simpr 484	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐺 ∈ (Poly‘𝑆))
61	60	3ad2ant1 1133	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝐺 ∈ (Poly‘𝑆))
62		fznn0sub 13571	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (0...𝑗) → (𝑗 − 𝑘) ∈ ℕ₀)
63	40, 62	syl 17	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝑗 − 𝑘) ∈ ℕ₀)
64	18, 5	dgrub 26189	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ (Poly‘𝑆) ∧ (𝑗 − 𝑘) ∈ ℕ₀ ∧ (𝐵‘(𝑗 − 𝑘)) ≠ 0) → (𝑗 − 𝑘) ≤ 𝑁)
65	64	3expia 1121	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺 ∈ (Poly‘𝑆) ∧ (𝑗 − 𝑘) ∈ ℕ₀) → ((𝐵‘(𝑗 − 𝑘)) ≠ 0 → (𝑗 − 𝑘) ≤ 𝑁))
66	61, 63, 65	syl2anc 584	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝐵‘(𝑗 − 𝑘)) ≠ 0 → (𝑗 − 𝑘) ≤ 𝑁))
67	66	necon1bd 2950	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (¬ (𝑗 − 𝑘) ≤ 𝑁 → (𝐵‘(𝑗 − 𝑘)) = 0))
68	59, 67	mpd 15	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝐵‘(𝑗 − 𝑘)) = 0)
69	68	oveq2d 7419	. . . . . . . . . . . . . 14 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = ((𝐴‘𝑘) · 0))
70	13	3ad2ant1 1133	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝐴:ℕ₀⟶ℂ)
71	70, 42	ffvelcdmd 7074	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝐴‘𝑘) ∈ ℂ)
72	71	mul01d 11432	. . . . . . . . . . . . . 14 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝐴‘𝑘) · 0) = 0)
73	69, 72	eqtrd 2770	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = 0)
74	73	3expia 1121	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) → ((𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = 0))
75	74	impl 455	. . . . . . . . . . 11 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ 𝑘 ≤ 𝑀) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = 0)
76		simpl 482	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐹 ∈ (Poly‘𝑆))
77	76	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) → 𝐹 ∈ (Poly‘𝑆))
78	11, 2	dgrub 26189	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ₀ ∧ (𝐴‘𝑘) ≠ 0) → 𝑘 ≤ 𝑀)
79	78	3expia 1121	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ₀) → ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑀))
80	77, 41, 79	syl2an 596	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) → ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑀))
81	80	necon1bd 2950	. . . . . . . . . . . . . 14 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) → (¬ 𝑘 ≤ 𝑀 → (𝐴‘𝑘) = 0))
82	81	imp 406	. . . . . . . . . . . . 13 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → (𝐴‘𝑘) = 0)
83	82	oveq1d 7418	. . . . . . . . . . . 12 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = (0 · (𝐵‘(𝑗 − 𝑘))))
84	20	ad3antrrr 730	. . . . . . . . . . . . . 14 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → 𝐵:ℕ₀⟶ℂ)
85	62	ad2antlr 727	. . . . . . . . . . . . . 14 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → (𝑗 − 𝑘) ∈ ℕ₀)
86	84, 85	ffvelcdmd 7074	. . . . . . . . . . . . 13 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → (𝐵‘(𝑗 − 𝑘)) ∈ ℂ)
87	86	mul02d 11431	. . . . . . . . . . . 12 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → (0 · (𝐵‘(𝑗 − 𝑘))) = 0)
88	83, 87	eqtrd 2770	. . . . . . . . . . 11 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = 0)
89	75, 88	pm2.61dan 812	. . . . . . . . . 10 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = 0)
90	89	sumeq2dv 15716	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) → Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = Σ𝑘 ∈ (0...𝑗)0)
91		fzfi 13988	. . . . . . . . . . 11 ⊢ (0...𝑗) ∈ Fin
92	91	olci 866	. . . . . . . . . 10 ⊢ ((0...𝑗) ⊆ (ℤ_≥‘0) ∨ (0...𝑗) ∈ Fin)
93		sumz 15736	. . . . . . . . . 10 ⊢ (((0...𝑗) ⊆ (ℤ_≥‘0) ∨ (0...𝑗) ∈ Fin) → Σ𝑘 ∈ (0...𝑗)0 = 0)
94	92, 93	ax-mp 5	. . . . . . . . 9 ⊢ Σ𝑘 ∈ (0...𝑗)0 = 0
95	90, 94	eqtrdi 2786	. . . . . . . 8 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) → Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = 0)
96	36, 95	eqtrd 2770	. . . . . . 7 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) = 0)
97	96	expr 456	. . . . . 6 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑗 ∈ ℕ₀) → (¬ 𝑗 ≤ (𝑀 + 𝑁) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) = 0))
98	97	necon1ad 2949	. . . . 5 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑗 ∈ ℕ₀) → (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) ≠ 0 → 𝑗 ≤ (𝑀 + 𝑁)))
99	98	ralrimiva 3132	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ∀𝑗 ∈ ℕ₀ (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) ≠ 0 → 𝑗 ≤ (𝑀 + 𝑁)))
100		plyco0 26147	. . . . 5 ⊢ (((𝑀 + 𝑁) ∈ ℕ₀ ∧ (𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))):ℕ₀⟶ℂ) → (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))) “ (ℤ_≥‘((𝑀 + 𝑁) + 1))) = {0} ↔ ∀𝑗 ∈ ℕ₀ (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) ≠ 0 → 𝑗 ≤ (𝑀 + 𝑁))))
101	9, 27, 100	syl2anc 584	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))) “ (ℤ_≥‘((𝑀 + 𝑁) + 1))) = {0} ↔ ∀𝑗 ∈ ℕ₀ (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) ≠ 0 → 𝑗 ≤ (𝑀 + 𝑁))))
102	99, 101	mpbird 257	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))) “ (ℤ_≥‘((𝑀 + 𝑁) + 1))) = {0})
103	11, 2	dgrub2 26190	. . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝐴 “ (ℤ_≥‘(𝑀 + 1))) = {0})
104	103	adantr 480	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐴 “ (ℤ_≥‘(𝑀 + 1))) = {0})
105	18, 5	dgrub2 26190	. . . . . 6 ⊢ (𝐺 ∈ (Poly‘𝑆) → (𝐵 “ (ℤ_≥‘(𝑁 + 1))) = {0})
106	105	adantl 481	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐵 “ (ℤ_≥‘(𝑁 + 1))) = {0})
107	11, 2	coeid 26193	. . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘))))
108	107	adantr 480	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘))))
109	18, 5	coeid 26193	. . . . . 6 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))))
110	109	adantl 481	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))))
111	76, 60, 48, 44, 13, 20, 104, 106, 108, 110	plymullem1 26169	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 ∘_f · 𝐺) = (𝑧 ∈ ℂ ↦ Σ𝑗 ∈ (0...(𝑀 + 𝑁))(Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) · (𝑧↑𝑗))))
112		elfznn0 13635	. . . . . . . 8 ⊢ (𝑗 ∈ (0...(𝑀 + 𝑁)) → 𝑗 ∈ ℕ₀)
113	112, 35	syl 17	. . . . . . 7 ⊢ (𝑗 ∈ (0...(𝑀 + 𝑁)) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) = Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))))
114	113	oveq1d 7418	. . . . . 6 ⊢ (𝑗 ∈ (0...(𝑀 + 𝑁)) → (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) · (𝑧↑𝑗)) = (Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) · (𝑧↑𝑗)))
115	114	sumeq2i 15712	. . . . 5 ⊢ Σ𝑗 ∈ (0...(𝑀 + 𝑁))(((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) · (𝑧↑𝑗)) = Σ𝑗 ∈ (0...(𝑀 + 𝑁))(Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) · (𝑧↑𝑗))
116	115	mpteq2i 5217	. . . 4 ⊢ (𝑧 ∈ ℂ ↦ Σ𝑗 ∈ (0...(𝑀 + 𝑁))(((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) · (𝑧↑𝑗))) = (𝑧 ∈ ℂ ↦ Σ𝑗 ∈ (0...(𝑀 + 𝑁))(Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) · (𝑧↑𝑗)))
117	111, 116	eqtr4di 2788	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 ∘_f · 𝐺) = (𝑧 ∈ ℂ ↦ Σ𝑗 ∈ (0...(𝑀 + 𝑁))(((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) · (𝑧↑𝑗))))
118	1, 9, 27, 102, 117	coeeq 26182	. 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (coeff‘(𝐹 ∘_f · 𝐺)) = (𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))))
119		ffvelcdm 7070	. . . 4 ⊢ (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))):ℕ₀⟶ℂ ∧ 𝑗 ∈ ℕ₀) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) ∈ ℂ)
120	27, 112, 119	syl2an 596	. . 3 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑗 ∈ (0...(𝑀 + 𝑁))) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) ∈ ℂ)
121	1, 9, 120, 117	dgrle 26198	. 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘(𝐹 ∘_f · 𝐺)) ≤ (𝑀 + 𝑁))
122	118, 121	jca 511	1 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘(𝐹 ∘_f · 𝐺)) = (𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))) ∧ (deg‘(𝐹 ∘_f · 𝐺)) ≤ (𝑀 + 𝑁)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 847 ∧ w3a 1086 = wceq 1540 ∈ wcel 2108 ≠ wne 2932 ∀wral 3051 ⊆ wss 3926 {csn 4601 class class class wbr 5119 ↦ cmpt 5201 “ cima 5657 ⟶wf 6526 ‘cfv 6530 (class class class)co 7403 ∘_f cof 7667 Fincfn 8957 ℂcc 11125 ℝcr 11126 0cc0 11127 1c1 11128 + caddc 11130 · cmul 11132 ≤ cle 11268 − cmin 11464 ℕ₀cn0 12499 ℤ_≥cuz 12850 ...cfz 13522 ↑cexp 14077 Σcsu 15700 Polycply 26139 coeffccoe 26141 degcdgr 26142

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7727 ax-inf2 9653 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 ax-pre-sup 11205

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-int 4923 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-se 5607 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6483 df-fun 6532 df-fn 6533 df-f 6534 df-f1 6535 df-fo 6536 df-f1o 6537 df-fv 6538 df-isom 6539 df-riota 7360 df-ov 7406 df-oprab 7407 df-mpo 7408 df-of 7669 df-om 7860 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8383 df-rdg 8422 df-1o 8478 df-er 8717 df-map 8840 df-pm 8841 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-sup 9452 df-inf 9453 df-oi 9522 df-card 9951 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11466 df-neg 11467 df-div 11893 df-nn 12239 df-2 12301 df-3 12302 df-n0 12500 df-z 12587 df-uz 12851 df-rp 13007 df-fz 13523 df-fzo 13670 df-fl 13807 df-seq 14018 df-exp 14078 df-hash 14347 df-cj 15116 df-re 15117 df-im 15118 df-sqrt 15252 df-abs 15253 df-clim 15502 df-rlim 15503 df-sum 15701 df-0p 25621 df-ply 26143 df-coe 26145 df-dgr 26146

This theorem is referenced by: coemul 26207 dgrmul2 26225

W3C validator