Let $x\leq y$ and $z\leq w$. Prove that:
$|x - w| + |y - z| \geq |x - z| + |y - w|$
This can be proved by taking cases for $y$ and using the triangle inequality:
for $y \geq w$ :
$|x - w| + |y - z| \geq |x - z| + |y - w|$
$|x - w| + (y - z) \geq |x - z| + (y - w)$
$(w - z) + |y - z| \geq |y - w|$
$|w - z| + |y - z| \geq |y - w|$ (true from the triangle inequality)
Then work similarly for the cases $z \leq y < w$ and $y < z$
I'm wondering if there is a way to prove that which doesn't involve as many cases and operations.
Without loss of generality and assuming $w\geq z$ and $y\geq x$, we may assume that one of $y$ and $w$ is the leftist (most left) point on the real line. Say $w$ is the leftist point. Then,
$|x - w| + |y - z| \geq |x - z| + |y - w|\iff x - w + |y - z| \geq |x - z| +y - w\iff$
$x-y + |y - z| \geq |x-z|\iff |x-y| + |y - z| \geq |x-z|$
which is true by triangular inequality.