We define a function:

$f: \mathbb{N} \to \mathbb{N}_0, \quad f(n) = n - 1$

• Well-defined: For every $n \in \mathbb{N}$, we have $n \ge 1$, so $n-1 \ge 0$. Hence $f(n) \in \mathbb{N}_0$, and the function is well-defined.
  
• Injective: Suppose $f(n_1) = f(n_2)$. Then
  $n_1 - 1 = n_2 - 1 \implies n_1 = n_2$.
  Hence $f$ is injective.
  
• Surjective: Let $m \in \mathbb{N}_0$. Define $n = m + 1 \in \mathbb{N}$. Then
  $f(n) = f(m+1) = (m+1)-1 = m$.
  Hence $f$ is surjective.

Conclusion: The function $f(n) = n-1$ is a bijection between $\mathbb{N}$ and $\mathbb{N}_0$.

It is defined as a bijection. The same way square-circles are defined as shapes that are both circles and squares. That does not mean they are logical possibilities, i.e. free from internal contradictions.

And there's a subtle difference between "You can pick any number from N and map it onto a unique number from N0" and "You can pick every number from N and map it onto a unique number from N0".