Is there a short way to show that $$y^{n-1}+x^n\leq x^{n-1}+y^n$$ for $n\in\mathbb N$ and $1<x<y$?
I have tried to show it with starting from the left side without rewriting the equation $$y^{n-1}+x^{n}=y^{n-1}+x\cdot x^{n-1}\leq x\cdot y^{n-1}+x^{n-1}\leq y\cdot y^{n-1} +x ^{n-1}.$$ But I am not sure how to show the second to last step without rewriting the equation.
$f(x)=x^{n}-x^{n-1}$ is an increasing function on $(1,\infty)$ because $f'(x)=nx^{n-1}-(n-1)x^{n-2} >0$ ( since $x >1 >1-\frac 1 n$). The required inequality simply says $x<y$ implies $f(x) <f(y)$.