In real analysis course, I need to prove $x \leq 0$ and $0 \leq y \implies x.y \leq 0$. I applied following approach but am not sure whether it is correct and acceptable proof.
- Assume $x \leq 0$
- Adding $-x$ to both sides yields $0 \leq -x$
- Assume $0 \leq y$
- We obtain $0 \leq -x.y$ from (2) and (3). (Recall the axiom $0 \leq x$ and $0 \leq y \implies 0 \leq x.y$)
- $0 \leq (-1).x.y$ and put $z = x.y$
- $0 \leq (-1).z$
- Add $z$ to both sides
- So, $z \leq (-1).z + z$ which is $z \leq -z + z$
- $z \leq 0$ which is $x.y \leq 0$
Every thing is good except you are taking it for granted that $(-x)y = -(xy)$ and that $-x = (-1)x$.
That must be proven.
And before you can prove that you must prove $0\cdot x = 0$.
You can not take either of those as a given.
And