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 26576

Description: Lemma for coemul 26578 and dgrmul 26596. (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 26547	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 ∘_f · 𝐺) ∈ (Poly‘ℂ))
2		coeadd.3	. . . . 5 ⊢ 𝑀 = (deg‘𝐹)
3		dgrcl 26559	. . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ₀)
4	2, 3	eqeltrid 2864	. . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑀 ∈ ℕ₀)
5		coeadd.4	. . . . 5 ⊢ 𝑁 = (deg‘𝐺)
6		dgrcl 26559	. . . . 5 ⊢ (𝐺 ∈ (Poly‘𝑆) → (deg‘𝐺) ∈ ℕ₀)
7	5, 6	eqeltrid 2864	. . . 4 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝑁 ∈ ℕ₀)
8		nn0addcl 12646	. . . 4 ⊢ ((𝑀 ∈ ℕ₀ ∧ 𝑁 ∈ ℕ₀) → (𝑀 + 𝑁) ∈ ℕ₀)
9	4, 7, 8	syl2an 608	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝑀 + 𝑁) ∈ ℕ₀)
10		fzfid 14121	. . . . 5 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) → (0...𝑛) ∈ Fin)
11		coefv0.1	. . . . . . . . . 10 ⊢ 𝐴 = (coeff‘𝐹)
12	11	coef3 26558	. . . . . . . . 9 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐴:ℕ₀⟶ℂ)
13	12	adantr 486	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐴:ℕ₀⟶ℂ)
14	13	adantr 486	. . . . . . 7 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) → 𝐴:ℕ₀⟶ℂ)
15		elfznn0 13759	. . . . . . 7 ⊢ (𝑘 ∈ (0...𝑛) → 𝑘 ∈ ℕ₀)
16		ffvelcdm 7084	. . . . . . 7 ⊢ ((𝐴:ℕ₀⟶ℂ ∧ 𝑘 ∈ ℕ₀) → (𝐴‘𝑘) ∈ ℂ)
17	14, 15, 16	syl2an 608	. . . . . 6 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑛)) → (𝐴‘𝑘) ∈ ℂ)
18		coeadd.2	. . . . . . . . . 10 ⊢ 𝐵 = (coeff‘𝐺)
19	18	coef3 26558	. . . . . . . . 9 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝐵:ℕ₀⟶ℂ)
20	19	adantl 487	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐵:ℕ₀⟶ℂ)
21	20	ad2antrr 739	. . . . . . 7 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑛)) → 𝐵:ℕ₀⟶ℂ)
22		fznn0sub 13695	. . . . . . . 8 ⊢ (𝑘 ∈ (0...𝑛) → (𝑛 − 𝑘) ∈ ℕ₀)
23	22	adantl 487	. . . . . . 7 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑛)) → (𝑛 − 𝑘) ∈ ℕ₀)
24	21, 23	ffvelcdmd 7088	. . . . . 6 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑛)) → (𝐵‘(𝑛 − 𝑘)) ∈ ℂ)
25	17, 24	mulcld 11334	. . . . 5 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) ∧ 𝑘 ∈ (0...𝑛)) → ((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))) ∈ ℂ)
26	10, 25	fsumcl 15906	. . . 4 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑛 ∈ ℕ₀) → Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))) ∈ ℂ)
27	26	fmpttd 7118	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))):ℕ₀⟶ℂ)
28		oveq2 7430	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑗 → (0...𝑛) = (0...𝑗))
29		fvoveq1 7445	. . . . . . . . . . . . 13 ⊢ (𝑛 = 𝑗 → (𝐵‘(𝑛 − 𝑘)) = (𝐵‘(𝑗 − 𝑘)))
30	29	oveq2d 7438	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑗 → ((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))) = ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))))
31	30	adantr 486	. . . . . . . . . . 11 ⊢ ((𝑛 = 𝑗 ∧ 𝑘 ∈ (0...𝑛)) → ((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))) = ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))))
32	28, 31	sumeq12dv 15879	. . . . . . . . . 10 ⊢ (𝑛 = 𝑗 → Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))) = Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))))
33		eqid 2760	. . . . . . . . . 10 ⊢ (𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))) = (𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))
34		sumex 15862	. . . . . . . . . 10 ⊢ Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) ∈ V
35	32, 33, 34	fvmpt 6996	. . . . . . . . 9 ⊢ (𝑗 ∈ ℕ₀ → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) = Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))))
36	35	ad2antrl 741	. . . . . . . 8 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) = Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))))
37		simp2r 1219	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ¬ 𝑗 ≤ (𝑀 + 𝑁))
38		simp2l 1218	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑗 ∈ ℕ₀)
39	38	nn0red 12673	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑗 ∈ ℝ)
40		simp3l 1220	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑘 ∈ (0...𝑗))
41		elfznn0 13759	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑘 ∈ (0...𝑗) → 𝑘 ∈ ℕ₀)
42	40, 41	syl 18	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑘 ∈ ℕ₀)
43	42	nn0red 12673	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑘 ∈ ℝ)
44	7	adantl 487	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝑁 ∈ ℕ₀)
45	44	3ad2ant1 1151	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑁 ∈ ℕ₀)
46	45	nn0red 12673	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑁 ∈ ℝ)
47	39, 43, 46	lesubadd2d 11920	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝑗 − 𝑘) ≤ 𝑁 ↔ 𝑗 ≤ (𝑘 + 𝑁)))
48	4	adantr 486	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝑀 ∈ ℕ₀)
49	48	3ad2ant1 1151	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑀 ∈ ℕ₀)
50	49	nn0red 12673	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑀 ∈ ℝ)
51		simp3r 1221	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝑘 ≤ 𝑀)
52	43, 50, 46, 51	leadd1dd 11935	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝑘 + 𝑁) ≤ (𝑀 + 𝑁))
53	43, 46	readdcld 11343	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝑘 + 𝑁) ∈ ℝ)
54	50, 46	readdcld 11343	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝑀 + 𝑁) ∈ ℝ)
55		letr 11409	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑗 ∈ ℝ ∧ (𝑘 + 𝑁) ∈ ℝ ∧ (𝑀 + 𝑁) ∈ ℝ) → ((𝑗 ≤ (𝑘 + 𝑁) ∧ (𝑘 + 𝑁) ≤ (𝑀 + 𝑁)) → 𝑗 ≤ (𝑀 + 𝑁)))
56	39, 53, 54, 55	syl3anc 1398	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝑗 ≤ (𝑘 + 𝑁) ∧ (𝑘 + 𝑁) ≤ (𝑀 + 𝑁)) → 𝑗 ≤ (𝑀 + 𝑁)))
57	52, 56	mpan2d 707	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝑗 ≤ (𝑘 + 𝑁) → 𝑗 ≤ (𝑀 + 𝑁)))
58	47, 57	sylbid 243	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝑗 − 𝑘) ≤ 𝑁 → 𝑗 ≤ (𝑀 + 𝑁)))
59	37, 58	mtod 201	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ¬ (𝑗 − 𝑘) ≤ 𝑁)
60		simpr 490	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐺 ∈ (Poly‘𝑆))
61	60	3ad2ant1 1151	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝐺 ∈ (Poly‘𝑆))
62		fznn0sub 13695	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑘 ∈ (0...𝑗) → (𝑗 − 𝑘) ∈ ℕ₀)
63	40, 62	syl 18	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝑗 − 𝑘) ∈ ℕ₀)
64	18, 5	dgrub 26560	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ (Poly‘𝑆) ∧ (𝑗 − 𝑘) ∈ ℕ₀ ∧ (𝐵‘(𝑗 − 𝑘)) ≠ 0) → (𝑗 − 𝑘) ≤ 𝑁)
65	64	3expia 1139	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺 ∈ (Poly‘𝑆) ∧ (𝑗 − 𝑘) ∈ ℕ₀) → ((𝐵‘(𝑗 − 𝑘)) ≠ 0 → (𝑗 − 𝑘) ≤ 𝑁))
66	61, 63, 65	syl2anc 596	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝐵‘(𝑗 − 𝑘)) ≠ 0 → (𝑗 − 𝑘) ≤ 𝑁))
67	66	necon1bd 2973	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (¬ (𝑗 − 𝑘) ≤ 𝑁 → (𝐵‘(𝑗 − 𝑘)) = 0))
68	59, 67	mpd 16	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝐵‘(𝑗 − 𝑘)) = 0)
69	68	oveq2d 7438	. . . . . . . . . . . . . 14 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = ((𝐴‘𝑘) · 0))
70	13	3ad2ant1 1151	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → 𝐴:ℕ₀⟶ℂ)
71	70, 42	ffvelcdmd 7088	. . . . . . . . . . . . . . 15 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → (𝐴‘𝑘) ∈ ℂ)
72	71	mul01d 11514	. . . . . . . . . . . . . 14 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝐴‘𝑘) · 0) = 0)
73	69, 72	eqtrd 2795	. . . . . . . . . . . . 13 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁)) ∧ (𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀)) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = 0)
74	73	3expia 1139	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) → ((𝑘 ∈ (0...𝑗) ∧ 𝑘 ≤ 𝑀) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = 0))
75	74	impl 461	. . . . . . . . . . 11 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ 𝑘 ≤ 𝑀) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = 0)
76		simpl 488	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐹 ∈ (Poly‘𝑆))
77	76	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) → 𝐹 ∈ (Poly‘𝑆))
78	11, 2	dgrub 26560	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ₀ ∧ (𝐴‘𝑘) ≠ 0) → 𝑘 ≤ 𝑀)
79	78	3expia 1139	. . . . . . . . . . . . . . . 16 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ₀) → ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑀))
80	77, 41, 79	syl2an 608	. . . . . . . . . . . . . . 15 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) → ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑀))
81	80	necon1bd 2973	. . . . . . . . . . . . . 14 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) → (¬ 𝑘 ≤ 𝑀 → (𝐴‘𝑘) = 0))
82	81	imp 412	. . . . . . . . . . . . 13 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → (𝐴‘𝑘) = 0)
83	82	oveq1d 7437	. . . . . . . . . . . 12 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = (0 · (𝐵‘(𝑗 − 𝑘))))
84	20	ad3antrrr 743	. . . . . . . . . . . . . 14 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → 𝐵:ℕ₀⟶ℂ)
85	62	ad2antlr 740	. . . . . . . . . . . . . 14 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → (𝑗 − 𝑘) ∈ ℕ₀)
86	84, 85	ffvelcdmd 7088	. . . . . . . . . . . . 13 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → (𝐵‘(𝑗 − 𝑘)) ∈ ℂ)
87	86	mul02d 11513	. . . . . . . . . . . 12 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → (0 · (𝐵‘(𝑗 − 𝑘))) = 0)
88	83, 87	eqtrd 2795	. . . . . . . . . . 11 ⊢ (((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) ∧ ¬ 𝑘 ≤ 𝑀) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = 0)
89	75, 88	pm2.61dan 825	. . . . . . . . . 10 ⊢ ((((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) ∧ 𝑘 ∈ (0...𝑗)) → ((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = 0)
90	89	sumeq2dv 15876	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) → Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = Σ𝑘 ∈ (0...𝑗)0)
91		fzfi 14120	. . . . . . . . . . 11 ⊢ (0...𝑗) ∈ Fin
92	91	olci 880	. . . . . . . . . 10 ⊢ ((0...𝑗) ⊆ (ℤ_≥‘0) ∨ (0...𝑗) ∈ Fin)
93		sumz 15895	. . . . . . . . . 10 ⊢ (((0...𝑗) ⊆ (ℤ_≥‘0) ∨ (0...𝑗) ∈ Fin) → Σ𝑘 ∈ (0...𝑗)0 = 0)
94	92, 93	ax-mp 5	. . . . . . . . 9 ⊢ Σ𝑘 ∈ (0...𝑗)0 = 0
95	90, 94	eqtrdi 2811	. . . . . . . 8 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) → Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) = 0)
96	36, 95	eqtrd 2795	. . . . . . 7 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ (𝑗 ∈ ℕ₀ ∧ ¬ 𝑗 ≤ (𝑀 + 𝑁))) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) = 0)
97	96	expr 462	. . . . . 6 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑗 ∈ ℕ₀) → (¬ 𝑗 ≤ (𝑀 + 𝑁) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) = 0))
98	97	necon1ad 2972	. . . . 5 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑗 ∈ ℕ₀) → (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) ≠ 0 → 𝑗 ≤ (𝑀 + 𝑁)))
99	98	ralrimiva 3154	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ∀𝑗 ∈ ℕ₀ (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) ≠ 0 → 𝑗 ≤ (𝑀 + 𝑁)))
100		plyco0 26517	. . . . 5 ⊢ (((𝑀 + 𝑁) ∈ ℕ₀ ∧ (𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))):ℕ₀⟶ℂ) → (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))) “ (ℤ_≥‘((𝑀 + 𝑁) + 1))) = {0} ↔ ∀𝑗 ∈ ℕ₀ (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) ≠ 0 → 𝑗 ≤ (𝑀 + 𝑁))))
101	9, 27, 100	syl2anc 596	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))) “ (ℤ_≥‘((𝑀 + 𝑁) + 1))) = {0} ↔ ∀𝑗 ∈ ℕ₀ (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) ≠ 0 → 𝑗 ≤ (𝑀 + 𝑁))))
102	99, 101	mpbird 260	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))) “ (ℤ_≥‘((𝑀 + 𝑁) + 1))) = {0})
103	11, 2	dgrub2 26561	. . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝐴 “ (ℤ_≥‘(𝑀 + 1))) = {0})
104	103	adantr 486	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐴 “ (ℤ_≥‘(𝑀 + 1))) = {0})
105	18, 5	dgrub2 26561	. . . . . 6 ⊢ (𝐺 ∈ (Poly‘𝑆) → (𝐵 “ (ℤ_≥‘(𝑁 + 1))) = {0})
106	105	adantl 487	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐵 “ (ℤ_≥‘(𝑁 + 1))) = {0})
107	11, 2	coeid 26564	. . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘))))
108	107	adantr 486	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑀)((𝐴‘𝑘) · (𝑧↑𝑘))))
109	18, 5	coeid 26564	. . . . . 6 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))))
110	109	adantl 487	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)((𝐵‘𝑘) · (𝑧↑𝑘))))
111	76, 60, 48, 44, 13, 20, 104, 106, 108, 110	plymullem1 26540	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 ∘_f · 𝐺) = (𝑧 ∈ ℂ ↦ Σ𝑗 ∈ (0...(𝑀 + 𝑁))(Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) · (𝑧↑𝑗))))
112		elfznn0 13759	. . . . . . . 8 ⊢ (𝑗 ∈ (0...(𝑀 + 𝑁)) → 𝑗 ∈ ℕ₀)
113	112, 35	syl 18	. . . . . . 7 ⊢ (𝑗 ∈ (0...(𝑀 + 𝑁)) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) = Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))))
114	113	oveq1d 7437	. . . . . 6 ⊢ (𝑗 ∈ (0...(𝑀 + 𝑁)) → (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) · (𝑧↑𝑗)) = (Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) · (𝑧↑𝑗)))
115	114	sumeq2i 15872	. . . . 5 ⊢ Σ𝑗 ∈ (0...(𝑀 + 𝑁))(((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) · (𝑧↑𝑗)) = Σ𝑗 ∈ (0...(𝑀 + 𝑁))(Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) · (𝑧↑𝑗))
116	115	mpteq2i 5200	. . . 4 ⊢ (𝑧 ∈ ℂ ↦ Σ𝑗 ∈ (0...(𝑀 + 𝑁))(((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) · (𝑧↑𝑗))) = (𝑧 ∈ ℂ ↦ Σ𝑗 ∈ (0...(𝑀 + 𝑁))(Σ𝑘 ∈ (0...𝑗)((𝐴‘𝑘) · (𝐵‘(𝑗 − 𝑘))) · (𝑧↑𝑗)))
117	111, 116	eqtr4di 2813	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 ∘_f · 𝐺) = (𝑧 ∈ ℂ ↦ Σ𝑗 ∈ (0...(𝑀 + 𝑁))(((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) · (𝑧↑𝑗))))
118	1, 9, 27, 102, 117	coeeq 26553	. 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (coeff‘(𝐹 ∘_f · 𝐺)) = (𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))))
119		ffvelcdm 7084	. . . 4 ⊢ (((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))):ℕ₀⟶ℂ ∧ 𝑗 ∈ ℕ₀) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) ∈ ℂ)
120	27, 112, 119	syl2an 608	. . 3 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) ∧ 𝑗 ∈ (0...(𝑀 + 𝑁))) → ((𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘))))‘𝑗) ∈ ℂ)
121	1, 9, 120, 117	dgrle 26569	. 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘(𝐹 ∘_f · 𝐺)) ≤ (𝑀 + 𝑁))
122	118, 121	jca 521	1 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → ((coeff‘(𝐹 ∘_f · 𝐺)) = (𝑛 ∈ ℕ₀ ↦ Σ𝑘 ∈ (0...𝑛)((𝐴‘𝑘) · (𝐵‘(𝑛 − 𝑘)))) ∧ (deg‘(𝐹 ∘_f · 𝐺)) ≤ (𝑀 + 𝑁)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∀wral 3076 ⊆ wss 3896 {csn 4584 class class class wbr 5102 ↦ cmpt 5185 “ cima 5653 ⟶wf 6537 ‘cfv 6541 (class class class)co 7422 ∘_f cof 7693 Fincfn 8978 ℂcc 11203 ℝcr 11204 0cc0 11205 1c1 11206 + caddc 11208 · cmul 11210 ≤ cle 11349 − cmin 11546 ℕ₀cn0 12611 ℤ_≥cuz 12970 ...cfz 13644 ↑cexp 14209 Σcsu 15860 Polycply 26509 coeffccoe 26511 degcdgr 26512

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7753 ax-inf2 9647 ax-cnex 11261 ax-resscn 11262 ax-1cn 11263 ax-icn 11264 ax-addcl 11265 ax-addrcl 11266 ax-mulcl 11267 ax-mulrcl 11268 ax-mulcom 11269 ax-addass 11270 ax-mulass 11271 ax-distr 11272 ax-i2m1 11273 ax-1ne0 11274 ax-1rid 11275 ax-rnegex 11276 ax-rrecex 11277 ax-cnre 11278 ax-pre-lttri 11279 ax-pre-lttrn 11280 ax-pre-ltadd 11281 ax-pre-mulgt0 11282 ax-pre-sup 11283

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-isom 6550 df-riota 7379 df-ov 7425 df-oprab 7426 df-mpo 7427 df-of 7695 df-om 7880 df-1st 8003 df-2nd 8004 df-frecs 8304 df-wrecs 8335 df-recs 8384 df-rdg 8423 df-1o 8481 df-er 8722 df-map 8854 df-pm 8855 df-en 8979 df-dom 8980 df-sdom 8981 df-fin 8982 df-sup 9439 df-inf 9440 df-oi 9509 df-card 10025 df-pnf 11350 df-mnf 11351 df-xr 11352 df-ltxr 11353 df-le 11354 df-sub 11548 df-neg 11549 df-div 11979 df-nn 12341 df-2 12410 df-3 12411 df-n0 12612 df-z 12699 df-uz 12971 df-rp 13126 df-fz 13645 df-fzo 13794 df-fl 13937 df-seq 14150 df-exp 14210 df-hash 14480 df-cj 15273 df-re 15274 df-im 15275 df-sqrt 15409 df-abs 15410 df-clim 15662 df-rlim 15663 df-sum 15861 df-0p 25998 df-ply 26513 df-coe 26515 df-dgr 26516

This theorem is used by: coemul 26578 dgrmul2 26595

W3C validator