While studying Hard-SVM topic in Shalev-Shwartz book I came across the following proof for the distance between point and hyperplane
$$\min\{\|\pmb x-\pmb v\|: \langle\pmb w,\pmb v\rangle + b = 0\}\\ \text{Taking }\ \pmb v = \pmb x\ - (\langle \pmb w, \pmb x \rangle +\ b)\pmb w\ \text{ we have that}\\ \langle\pmb w,\pmb v\rangle+\ b = \langle\pmb w,\pmb x\rangle-\ (\langle \pmb w, \pmb x \rangle\ +\ b)\|\pmb w\|^2\ +\ b = 0,\\ \text{and}\\ \|\pmb x-\pmb v\|=|\langle \pmb w,\pmb x \rangle+\ b|\|\pmb w\| = |\langle \pmb w,\pmb x\rangle\ +\ b|$$
Above is a proof for the distance between point $\pmb x$ and the hyperplane defined by $(\pmb w, b)$ where $\|\pmb w\|=1$ which is $|\langle \pmb w, \pmb x \rangle+b|$
I can derive the same proof by taking a point on the plane say $\pmb y$ and then taking a orthogonal projection of $\pmb x - \pmb y$ on the normal vector of the plane, but not able to understand the proof provided in the book. I would greatly appreciate if anyone can explain the above proof.
PS: I understand the first line in the proof points towards finding a point $\pmb v$ on the plane such that the distance between $\pmb x \ \text{and }\ \pmb v$ is minimized.
Thanks