Proving the product rule for polynomials without limits or derivative rules As I said in the title, in the book where this exercise was proposed, derivatives or limits were not introduced yet. The exercise was to show that given the function $':\mathbb{C}[x]\rightarrow \mathbb{C}[x]$ I should show that $(fg)'=f'g+fg'$
$f'(x)$ was defined as $\sum_{k=1}^{n}ka_kx^{k-1}$ where $f(x)=\sum_{k=0}^{n}a_kx^k$.
I have found out that an equivalent representation for $f'(x)$ is $\sum_{k=0}^{n-1}(k+1)a_{k+1}x^{k}$
I have tried to prove the result myself step by step but there must be an error somewhere in the proof because in the end the result does not fit the bill.
$fg=\sum_{k=0}^{m+n}c_kx^k$ with $c_k=\sum_{r+s=k}a_rb_s$
$(fg)'=\sum_{j=0}^{m+n-1}(j+1)c_{j+1}x^{j}$
$f=\sum_{r=0}^{n}a_rx^r$
$f'=\sum_{r=0}^{n-1}(r+1)a_{r+1}x^r$
$g=\sum_{s=0}^{m}b_sx^s$
$g'=\sum_{s=0}^{m-1}(s+1)b_{s+1}x^s$
$f'g=\sum_{j=0}^{m+n-1}c'_jx^j$, with $c'_j=\sum_{r+s=j}(r+1)a_{r+1}b_s$
$fg'=\sum_{j=0}^{m+n-1}c''_jx^j$, with $c''_j=\sum_{r+s=j}a_r(s+1)b_{s+1}$
I have tried to prove by induction that for every $j$ we have 
$c'_j+c''_{j}=(j+1)c_{j+1}$
but I failed to show that the coefficients of both polynomials are equal. Where is the mistake? Can somebody give me a hint please?
The Problem is the induction step; I don't know how I can use the induction hypothesis to my advantage; I have made the induction over $j$ and I could Show it for $j=0$ and $j=1$ (just to be sure):
The claim is
$$(j+1)\sum_{r+s=j+1}a_rb_s=\sum_{r+s=j}(r+1)a_{r+1}b_s+\sum_{r+s=j}a_r(s+1)b_{s+1}$$
I also know that $(j+1)\sum_{r+s=j+1}a_rb_s=(j+1)\sum_{r=0}^{j+1}a_rb_{j+1-r}$
 A: It is easier to not use coefficients at all - except that we initially check by straightforward computation
$$\tag1 (f+g)'=f'+g',$$ $$\tag2 (cf)'=cf',$$ $$\tag3 (xf)'=f+f'.$$
$$\tag 4c'=0$$ 
Let $A\subseteq \Bbb C[x]$ be the set of polynomials $f$ with the property that $(fg)'=f'g+fg'$ for all polynomials $g$. 
If $f_1,f_2\in A$, then for every polynomial $g$,
$$\begin{align}((f_1+f_2)g)'&=(f_1g+f_2g)'\\&=(f_1g)'+(f_2g)'&\text{by }(1)\\&=f_1g'+f_1'g+f_2g'+f_2'g\\&=(f_1+f_2)g'+(f_1'+f_2')g\\
&=(f_1+f_2)g'+(f_1+f_2)'g&\text{by }(1)\end{align} $$
Thus,

$A$ is closed under addition.

Assume $f_1,f_2\in A$. Then for any polynomial $g$,
$$\begin{align}
((f_1f_2)g)'&=(f_1(f_2g))'\\
&=f_1'f_2g+f_1(f_2g)'\\
&=f_1'f_2g+f_1(f_2'g+f_2g')\\
&=(f_1'f_2+f_1f_2')g+f_1f_2g'.
\end{align}$$
We conclude that 

$A$ is closed under multiplication.

From $(2)$ and $(4)$, we see that

$A$ contains all constants

and from $(3)$ (after verifying that in particular $x'=1$)

$x\in A$.

Now observe that the four highlighted statements imply that $A=\Bbb C[x]$.
