Theorem plyadd 15943

Description: The sum of two polynomials is a polynomial. (Contributed by Mario Carneiro, 21-Jul-2014.)

Hypotheses

Ref	Expression
plyadd.1	⊢ (𝜑 → 𝐹 ∈ (Poly‘𝑆))
plyadd.2	⊢ (𝜑 → 𝐺 ∈ (Poly‘𝑆))
plyadd.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)

Assertion

Ref	Expression
plyadd	⊢ (𝜑 → (𝐹 ∘𝑓 + 𝐺) ∈ (Poly‘𝑆))

Distinct variable groups:   𝑥,𝑦,𝐹   𝑥,𝑆,𝑦   𝑥,𝐺,𝑦   𝜑,𝑥,𝑦

Proof of Theorem plyadd

Dummy variables 𝑘 𝑚 𝑛 𝑧 𝑎 𝑏 𝑗 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		plyadd.1	. . 3 ⊢ (𝜑 → 𝐹 ∈ (Poly‘𝑆))
2		elply2 15927	. . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) ↔ (𝑆 ⊆ ℂ ∧ ∃𝑚 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘))))))
3	2	simprbi 275	. . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∃𝑚 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))))
4	1, 3	syl 14	. 2 ⊢ (𝜑 → ∃𝑚 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))))
5		plyadd.2	. . 3 ⊢ (𝜑 → 𝐺 ∈ (Poly‘𝑆))
6		elply2 15927	. . . 4 ⊢ (𝐺 ∈ (Poly‘𝑆) ↔ (𝑆 ⊆ ℂ ∧ ∃𝑛 ∈ ℕ0 ∃𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘))))))
7	6	simprbi 275	. . 3 ⊢ (𝐺 ∈ (Poly‘𝑆) → ∃𝑛 ∈ ℕ0 ∃𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))
8	5, 7	syl 14	. 2 ⊢ (𝜑 → ∃𝑛 ∈ ℕ0 ∃𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))
9		reeanv 2721	. . 3 ⊢ (∃𝑚 ∈ ℕ0 ∃𝑛 ∈ ℕ0 (∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ∃𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘))))) ↔ (∃𝑚 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ∃𝑛 ∈ ℕ0 ∃𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘))))))
10		reeanv 2721	. . . . 5 ⊢ (∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)∃𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)(((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘))))) ↔ (∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ∃𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘))))))
11		simp1l 1052	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → 𝜑)
12	11, 1	syl 14	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → 𝐹 ∈ (Poly‘𝑆))
13	11, 5	syl 14	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → 𝐺 ∈ (Poly‘𝑆))
14		plyadd.3	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
15	11, 14	sylan 283	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥 + 𝑦) ∈ 𝑆)
16		simp1rl 1093	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → 𝑚 ∈ ℕ0)
17		simp1rr 1094	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → 𝑛 ∈ ℕ0)
18		simp2l 1054	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → 𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0))
19		simp2r 1055	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0))
20		simp3ll 1099	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → (𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0})
21		simp3rl 1101	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → (𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0})
22		simp3lr 1100	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘))))
23		oveq1 6092	. . . . . . . . . . . . 13 ⊢ (𝑧 = 𝑤 → (𝑧↑𝑘) = (𝑤↑𝑘))
24	23	oveq2d 6101	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → ((𝑎‘𝑘) · (𝑧↑𝑘)) = ((𝑎‘𝑘) · (𝑤↑𝑘)))
25	24	sumeq2sdv 12155	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑤↑𝑘)))
26		fveq2 5695	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑗 → (𝑎‘𝑘) = (𝑎‘𝑗))
27		oveq2 6093	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑗 → (𝑤↑𝑘) = (𝑤↑𝑗))
28	26, 27	oveq12d 6103	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑗 → ((𝑎‘𝑘) · (𝑤↑𝑘)) = ((𝑎‘𝑗) · (𝑤↑𝑗)))
29	28	cbvsumv 12146	. . . . . . . . . . 11 ⊢ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑤↑𝑘)) = Σ𝑗 ∈ (0...𝑚)((𝑎‘𝑗) · (𝑤↑𝑗))
30	25, 29	eqtrdi 2287	. . . . . . . . . 10 ⊢ (𝑧 = 𝑤 → Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)) = Σ𝑗 ∈ (0...𝑚)((𝑎‘𝑗) · (𝑤↑𝑗)))
31	30	cbvmptv 4227	. . . . . . . . 9 ⊢ (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘))) = (𝑤 ∈ ℂ ↦ Σ𝑗 ∈ (0...𝑚)((𝑎‘𝑗) · (𝑤↑𝑗)))
32	22, 31	eqtrdi 2287	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → 𝐹 = (𝑤 ∈ ℂ ↦ Σ𝑗 ∈ (0...𝑚)((𝑎‘𝑗) · (𝑤↑𝑗))))
33		simp3rr 1102	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘))))
34	23	oveq2d 6101	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → ((𝑏‘𝑘) · (𝑧↑𝑘)) = ((𝑏‘𝑘) · (𝑤↑𝑘)))
35	34	sumeq2sdv 12155	. . . . . . . . . . 11 ⊢ (𝑧 = 𝑤 → Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑤↑𝑘)))
36		fveq2 5695	. . . . . . . . . . . . 13 ⊢ (𝑘 = 𝑗 → (𝑏‘𝑘) = (𝑏‘𝑗))
37	36, 27	oveq12d 6103	. . . . . . . . . . . 12 ⊢ (𝑘 = 𝑗 → ((𝑏‘𝑘) · (𝑤↑𝑘)) = ((𝑏‘𝑗) · (𝑤↑𝑗)))
38	37	cbvsumv 12146	. . . . . . . . . . 11 ⊢ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑤↑𝑘)) = Σ𝑗 ∈ (0...𝑛)((𝑏‘𝑗) · (𝑤↑𝑗))
39	35, 38	eqtrdi 2287	. . . . . . . . . 10 ⊢ (𝑧 = 𝑤 → Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)) = Σ𝑗 ∈ (0...𝑛)((𝑏‘𝑗) · (𝑤↑𝑗)))
40	39	cbvmptv 4227	. . . . . . . . 9 ⊢ (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘))) = (𝑤 ∈ ℂ ↦ Σ𝑗 ∈ (0...𝑛)((𝑏‘𝑗) · (𝑤↑𝑗)))
41	33, 40	eqtrdi 2287	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → 𝐺 = (𝑤 ∈ ℂ ↦ Σ𝑗 ∈ (0...𝑛)((𝑏‘𝑗) · (𝑤↑𝑗))))
42	12, 13, 15, 16, 17, 18, 19, 20, 21, 32, 41	plyaddlem 15941	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)) ∧ (((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘)))))) → (𝐹 ∘𝑓 + 𝐺) ∈ (Poly‘𝑆))
43	42	3expia 1236	. . . . . 6 ⊢ (((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) ∧ (𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0) ∧ 𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0))) → ((((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘))))) → (𝐹 ∘𝑓 + 𝐺) ∈ (Poly‘𝑆)))
44	43	rexlimdvva 2676	. . . . 5 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) → (∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)∃𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)(((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘))))) → (𝐹 ∘𝑓 + 𝐺) ∈ (Poly‘𝑆)))
45	10, 44	biimtrrid 153	. . . 4 ⊢ ((𝜑 ∧ (𝑚 ∈ ℕ0 ∧ 𝑛 ∈ ℕ0)) → ((∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ∃𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘))))) → (𝐹 ∘𝑓 + 𝐺) ∈ (Poly‘𝑆)))
46	45	rexlimdvva 2676	. . 3 ⊢ (𝜑 → (∃𝑚 ∈ ℕ0 ∃𝑛 ∈ ℕ0 (∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ∃𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘))))) → (𝐹 ∘𝑓 + 𝐺) ∈ (Poly‘𝑆)))
47	9, 46	biimtrrid 153	. 2 ⊢ (𝜑 → ((∃𝑚 ∈ ℕ0 ∃𝑎 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑎 “ (ℤ≥‘(𝑚 + 1))) = {0} ∧ 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑚)((𝑎‘𝑘) · (𝑧↑𝑘)))) ∧ ∃𝑛 ∈ ℕ0 ∃𝑏 ∈ ((𝑆 ∪ {0}) ↑𝑚 ℕ0)((𝑏 “ (ℤ≥‘(𝑛 + 1))) = {0} ∧ 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑛)((𝑏‘𝑘) · (𝑧↑𝑘))))) → (𝐹 ∘𝑓 + 𝐺) ∈ (Poly‘𝑆)))
48	4, 8, 47	mp2and 437	1 ⊢ (𝜑 → (𝐹 ∘𝑓 + 𝐺) ∈ (Poly‘𝑆))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∃wrex 2529   ∪ cun 3218   ⊆ wss 3220  {csn 3709   ↦ cmpt 4192   “ cima 4777  ‘cfv 5377  (class class class)co 6085   ∘_𝑓 cof 6300   ↑_𝑚 cmap 6922  ℂcc 8178  0cc0 8180  1c1 8181   + caddc 8183   · cmul 8185  ℕ₀cn0 9568  ℤ_≥cuz 9931  ...cfz 10422  ↑cexp 10990  Σcsu 12138  Polycply 15920

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-nul 4259  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-iinf 4735  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-mulrcl 8279  ax-addcom 8280  ax-mulcom 8281  ax-addass 8282  ax-mulass 8283  ax-distr 8284  ax-i2m1 8285  ax-0lt1 8286  ax-1rid 8287  ax-0id 8288  ax-rnegex 8289  ax-precex 8290  ax-cnre 8291  ax-pre-ltirr 8292  ax-pre-ltwlin 8293  ax-pre-lttrn 8294  ax-pre-apti 8295  ax-pre-ltadd 8296  ax-pre-mulgt0 8297  ax-pre-mulext 8298  ax-arch 8299  ax-caucvg 8300

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-tr 4230  df-id 4438  df-po 4441  df-iso 4442  df-iord 4511  df-on 4513  df-ilim 4514  df-suc 4516  df-iom 4738  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-isom 5386  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-of 6302  df-1st 6374  df-2nd 6375  df-recs 6576  df-irdg 6641  df-frec 6662  df-1o 6687  df-oadd 6691  df-er 6807  df-map 6924  df-en 7023  df-dom 7024  df-fin 7025  df-sup 7325  df-pnf 8363  df-mnf 8364  df-xr 8365  df-ltxr 8366  df-le 8367  df-sub 8501  df-neg 8502  df-reap 8906  df-ap 8913  df-div 9006  df-inn 9308  df-2 9366  df-3 9367  df-4 9368  df-n0 9569  df-z 9650  df-uz 9932  df-q 10030  df-rp 10066  df-fz 10423  df-fzo 10561  df-seqfrec 10900  df-exp 10991  df-ihash 11231  df-cj 11623  df-re 11624  df-im 11625  df-rsqrt 11780  df-abs 11781  df-clim 12064  df-sumdc 12139  df-ply 15922

This theorem is used by:  plysub  15945  plyaddcl  15946  plycolemc  15950