I define a fuction $*$ in a recursive way on a subset of natural numbers (with subset I mean that is $*$ define in the second argument only for $\Bbb N-\{0,1\}$ in other words we have $*:\Bbb N \times (\Bbb N-\{0,1\})\rightarrow \Bbb N$
$$m * 2:=m+m$$ $$m* S(n+2):=m+(m*(n+2))$$
I'm not sure if a proof of the non-totality of $*$ on the natural numbers is needed:
$A$-The non-totality is, in my opinion, self-evident and doesn't need a proof because the definition defines it only for $\Bbb N-\{0,1\}$
$B$-but maybe it needs a proof because I'm stating that a property $\phi$ holds for the function I've defined (exist a number $n_0$ such that for every pair of the form $(n_0,m)$ we have that $(n_0,m)\notin f$ is true)
So my question is:
Do I need to give a proof even if the non totality is self-evident from the recursive definition? If I have to give a proof, what can be its "shape" ?