First reduction
After a rotation (or a selection of coordinates) we may WLOG assume that u and v are vectors in ${\bf R}^3$ and that $x=(1,0,0)^\top$. So the desired inequality is equivalent to
$$
v_1^2-u_1^2 \leq \sqrt{ 1- (u^\top v)^2 }
$$
and it suffices to prove that
$$
(u_1^2-v_1^2)^2 \leq 1 - (u^\top v)^2
$$
which is equivalent to
$$
1 \geq (u_1^2-v_1^2)^2 + (u^\top v)^2
$$
Second reduction
Since the RHS increases if we replace each entry of $u$ or $v$ by its modulus, and this change still preserves the constraint that $u$ and $v$ are unit vectors, we may WLOG assume that all entries of these vectors are in $[0,1]$. (This is not essential, but it makes some formulas more symmetrical)
To simplify some formulas, let $a=u_1$ and $b=v_1$.
Then, by the Cauchy–Schwarz inequality (in ${\bf R}^2$) and the assumption that $u$ and $v$ are unit vectors,
$$
u_2v_2+u_3v_3 \leq \sqrt{1-a^2}\sqrt{1-b^2}
$$
and so
$$
(u^\top v)^2 =(ab+u_2v_2+u_3v_3)^2 \leq (ab+\sqrt{1-a^2}\sqrt{1-b^2})^2
$$
Hence it suffices to prove that
$$
\displaystyle 1 \geq (a^2-b^2)^2 + (ab+\sqrt{1-a^2}\sqrt{1-b})^2
$$
subject to the constraints $0\leq a\leq 1, 4\leq b\leq 1$.
Final step
Expanding, this is equivalent to
$$
1\geq a^4 -2a^2b^2 + b^4 + a^2b^2 + 2ab\sqrt{1-a^2}\sqrt{1-b^2} + (1-a^2)(1-b^2)
$$
which rearranges to
$$
a^2(1-a^2) + b^2(1-b^2) \geq 2 ab\sqrt{1-a^2}\sqrt{1-b^2}
$$
This now follows by applying the AM-GM inequality to $a\sqrt{1-a^2}$ and $b\sqrt{1-b^2}$.
Afterthought
The use of Cauchy–Schwarz in the second stage could probably be replaced with a more geometric argument, but I don't quite have the right intuition.