gcd and lcm - Bezout's identity: which half is larger?

Bezout's identity: Let a and b be integers with greatest common divisor d. Then, there exist integers x and y such that ax + by = d.

Is it true that if a > b then ax < by? Is there a proof for this?