Prove that $mn < 0$ if and only if $m > 0$ and $n < 0$ or $m < 0$ and $n > 0$. $m,n$ element of integers
Just starting out teaching myself discrete math still really bad at proofs, any help/advice on how to think/go about this would be greatly appreciated.
We need to make a few assumptions about how you have integers defined, but a very safe assumption is that you have defined $(\Bbb Z, +, \times, \leq)$ as an ordered commutative ring with identity constructed from the natural numbers in the usual way.
In particular, as part of the very definition of $(\Bbb Z,+,\times,\leq)$, we have the following (among many more properties, these are just the important ones necessary for my proof):
(In all of the following, $a,b,c$ and $x$ are arbitrary integers)
Properties of $+$
Properties of $\leq$ (and $<$)
Properties of $-$
Properties of $\times$
Starting the desired proof, we approach via contrapositive for the forward implication. That is, we wish to prove that if ($0\leq m$ and $0\leq n$) or ($m\leq 0$ and $n\leq 0$) then $0\leq m\times n$. In doing so, we will have proven that $m\times n<0$ implies $m<0$ and $0<n$ or $0<m$ and $n<0$.
Suppose $0\leq m$ and $0\leq n$. Then by definition $0\leq m\times n$, so we are done.
Suppose $m\leq 0$ and $n\leq 0$. Then $m+(-m)\leq 0+(-m)$ and therefore $0\leq -m$. Similarly $0\leq -n$. Then $0\leq (-m)\times (-n) = ((-1)\times m)\times ((-1)\times n) = (-1)\times (-1)\times m\times n = m\times n$.
Thus if $m\leq 0$ and $n\leq 0$ or if $0\leq m$ and $0\leq n$, we have $0\leq m\times n$
For the remaining direction for the proof, we wish to show that if $0<m$ and $n<0$ or if $m<0$ and $0<n$ then $m\times n < 0$
Suppose $0<m$ and $n<0$. Then $n+(-n)<0+(-n)=-n$. Thus $0<m\times (-n)$. Thus $0+(m\times n) < m\times (-n)+(m\times n) = m\times (-1)\times n + m\times n = -(m\times n)+(m\times n) = 0$. Therefore $m\times n<0$
The proof for $m<0$ and $0<n$ is identical by relabeling which was $m$ and which was $n$.