Reading this proof, I don't understand a part of the inductive step (copied below). I do not understand how we are going from
$$ \leq 2-\frac{1}{k}+\frac{1}{(k+1)^2}\quad\text{(by $S(k)$)} $$ to $$ = 2-\frac{1}{k+1}\left(\frac{k+1}{k}-\frac{1}{k+1}\right) $$
Inductive step: Fix some $k\geq 2$ and suppose that $S(k)$ is true. It remains to show that $$ S(k+1) : 1+\frac{1}{4}+\frac{1}{9}+\cdots+\frac{1}{k^2}+\frac{1}{(k+1)^2}\leq 2-\frac{1}{k+1} $$ holds. Starting with the left-hand side of $S(k+1)$, \begin{align} 1+\frac{1}{4}+\cdots+\frac{1}{k^2}+\frac{1}{(k+1)^2} &\leq 2-\frac{1}{k}+\frac{1}{(k+1)^2}\quad\text{(by $S(k)$)}\\[1em] &= 2-\frac{1}{k+1}\left(\frac{k+1}{k}-\frac{1}{k+1}\right)\\[1em] &= 2-\frac{1}{k+1}\left(\frac{k^2+k+1}{k(k+1)}\right)\tag{simplify}\\[1em] &< 2-\frac{1}{k+1}.\tag{$\dagger$} \end{align}