 As the less than or equal to relation (\(\leq\)) is logically equivalent to \(x &lt; y \vee x = y\) it will follow from the next set of observations that this relation is also primitive recursive. The is additionally true of \(x &gt; y\), \(x \geq y\) and \(x \neq y\).