Absolute inequality derivation I have been trying to prove an inequality that I am not even sure if it is even true or not. However I am experiencing great difficulties with this proof. I have an intuition that it is true and have been trying to derive it but with no success. 
Here is the following set up:
$0 < x \leq y $
$0 < a \leq b $
From this I am trying to derive the following:
$|y-b|+|x-a| \leq |y-a| + |x-b|$
I have tried 'reverse engineering' and trying to come back to a statement that be easily derived from the initial set up but without success. After this I tried playing around with triangle inequalities but ended doing recursive steps in my solution attempts.
The inequality isn't random but some sort of "intuition" coming from that if we add the difference of the smaller numbers (x,a) to the difference of the bigger numbers (y,b) then this will be smaller than if we just pair them up the other way (y,a) and (x,b). Of course this intuition could be wrong.
Does anyone know if this is true and how would I work to prove it?

Hint:
$t\mapsto |t|$ is convex, so Karamata's inequality allows you to conclude from $(y-a, x-b)\succ (y-b, x-a)$. 
