Show that $||x| - |y|| \le |x-y|$ for all $x, y, \in \mathbb{R}$
Working:
So we know that $|x| = |(x-y) + y | \le |x-y|+|y|$
Thus, $|x|-|y| \le |x-y| \ \cdots (1)$ and similarly, $|y|-|x| = -(|x|-|y|) \le |x-y| \ \cdots (2)$.
We also know that $||x|-|y|| = \begin{cases} |x|-|y| \ \text{if} \ |x| - |y| \ge 0 \\ -(|x| - |y|) \ \text{if} \ |x| - |y| < 0 \end{cases}$
Query:
I'm not exactly sure how to finish off the proof. Can I say because $(1)$ and $(2)$ are both true, then $||x| - |y|| \le |x-y|$ as required?
Yes you can. If you are unsure, you can divide the proof in two cases: $|x|-|y|<0$ or $|x|-|y| \geq 0$. You can prove the inequality in both cases and these cases contain all possibilities, so you have proved the inequality in all cases.