For a convex set $K$, $x\in \mathbb{R}^d$ and $y=\Pi_K(x) $ (the projection of $x$ onto $K$), we want to show that for any $z\in K$ it holds that: $\|x-z\| \ge \|y-z\|$.
$$ $$
I'm not sure if the following proof is valid:
$$ y=\Pi_K(x) = \arg \min_{y\in K} ||y-x|| \Rightarrow \forall z\in K \langle y-x,y-z\rangle =0 $$ $$ ||y-x||^2_2+||y-z||^2_2=||x-z||^2_2 \quad (Pythagoras)$$ $$ \Rightarrow ||y-z||^2_2 \le ||x-z||^2_2 $$ $$ \Rightarrow||y-z|| \le ||x-z|| $$