I was triying to do this but I couldn't then, I tried to see the answer, and, the answer not satisfies me. The book, and my search on the internet use this.
$$|x + y| \le |x| + |y|$$ Which is true, then they use someone called "Triangular Inequality"
$$|(x - y) + y| \le |x - y| + |y|$$
$$|x| \le |x - y| + |y|$$
$$|x| - |y| \le |x - y|$$
And that's the proof, but, it doesn't seem so good for me.
If I have the first inequality again (Which is true)
$$|x + y| \le |x| + |y|$$ Then, let $x$ be $(n - k)$ and $n,k \in \Re$
$$|(n - k) + y| \le |n - k| + |y|$$
$$|(n - k) + y| - |y| \le |n - k|$$
Then, my proof is based in the fact that if k = y, then
$$|n| - |y| \le |n - k|$$ Which is I want to prove. That's why I don't get the first proof, because to me seems so arbitrary
You've proven $|n-k+y|-|y|\le|n-k|$ for any $n,\,k,\,y$. The special case $k=y$ of this theorem is therefore also valid, giving $|n|-|y|\le|n-y|$. Although any other choice of $k$ wouldn't obtain this second result, as long as some value of $k$ lets you obtain it it's proven.