A binary relation $R$ over a set $X$ is transitive if:
$$\forall a,b,c \in X.(aRb\wedge bRc) \Rightarrow aRc$$
Let me define a particular relation $R$ over $\mathbb{N} = \{0, 1, 2,\dots\}$:
$$aRb := \exists n\in \mathbb{N}. a = b + n$$
Clearly, $R$ is reflexive. However, $R$ seems to be "more" than transitive. In particular, if I know that
$$aRb \wedge bRc$$
then clearly I know $aRc$. To be exact, if I know that
$$(\exists n_1\in \mathbb{N}. a = b + n_1)\ \wedge\ (\exists n_2\in \mathbb{N}. b = c + n_2)$$
then I know:
$$\exists n_3\in \mathbb{N}. a = c + n_3$$
However, I know precisely which $n_3$, namely $n_1 + n_2$. Is there a mathematical notion for this kind of relation?
Many thanks, and happy holidays!
Martin