I'm pretty skeptical that you can prove Catalan's conjecture with this, but let's assume ##a>b\geq 1##, and let's let ##x > y \geq 0##. We will prove##a^x + b^y \geq a^y+b^x##. Your use case is ##x=a## and ##y=b##.
##a^x+b^y=a^ya^{x-y}+b^y## and ##a^y+b^z= a^y+b^y b^{x-y}##. Both of these expressions are ##a^y+b^y## where we multiply one of the summands by some quantity. Since the summands are at least one and the multipliers are at least one, it is hopefully intuitive that if we multiply the larger summand by a larger number, the thing we get is larger overall. ##a^y>b^y## and ##a^{x-y}>b^{x-y}##, so that completes the intuitive proof.If you want to throw more algebra at it, we need to compute exactly how much larger than ##a^y+b^y## each side is
##a^ya^{x-y}+b^y = a^y(a^{x-y}-1+1)+b^y##
##=a^y(a^{x-y}-1)+a^y +b^y##
Similarly ##a^y+b^x= a^y+b^y+ b^y(b^{x-y}-1)##.
So all we have to do is prove ##a^y(a^{x-y}-1) \geq b^y(b^{x-y}-1)##. Note each side is multiplying two non negative numbers, so it suffices to prove each piece of the multiplication is larger. Since ##a>b##, ##y\geq 0## and ##x-y\geq 0##, we get ##a^y>b^y##, and ##a^{x-y} \geq b^{x-y}##. Subtracting one from the last inequality completes the proof.