The title statement can be proven using the contrapositive, note that $x$ odd or $y$ odd means that at least one of $x\cdot y,x+y$ is odd. Is there a way to prove the statement directly?
To generalize on this statement (in two integer variables), show that for every square free integer $n$, there exists a function $f:\mathbb Z^2\to\mathbb Z$ where
$$f(x,y)\equiv 0\pmod n\iff x\equiv y\equiv 0\pmod n$$
This generalization is formalized in this question: If $n$ is squarefree, $k\ge 2$, then $\exists f\in\Bbb Z[x_1,\dots,x_k] : f(\overline x)\equiv 0\pmod n\iff \overline x\equiv \overline 0\pmod n$
Observe that $\displaystyle (x+1)(y+1)=xy+x+y+1$ is odd as $xy,x+y$ are even
If $x$ is odd $\iff x+1$ is even