I came across the following statement which I can't prove:
Let $E$ and $F$ be Hilbert spaces and $A:E\to F$ a linear operator. Assume that $\hat{x}$ is the least squares solution to the problem $Ax=y$ closest to an element $x_0\in E$. Then $\hat{x}-x_0\in(\text{Ker}A)^\perp $.
The statement of your problem is not very clear.
An interpretation which makes good sense of the question: You want to minimize $x\in E\mapsto \|y-Ax\|^2\in {\Bbb R}_+$ and if there are several solutions you want to pick the one closest to some $x_0$.
By variation, $x$ is a minimizer iff $A^*A x = A^* y$. Assume that a solution $x_1$ to this equation exists (always true in finite dimensions) then any other solution must lie in the affine subspace $x_1+V$ with $V=\ker A^*A= \ker A$. The one closest to $x_0$ is the orthogonal projection of $x_0$ onto $x_1+V$, i.e. the unique element $\widehat{x}\in x_1+V$ for which $\widehat{x}-x_0\perp V=\ker A$.