An inductive set is a set $I$ such that $1 \in I$ and if $x \in I$ then $x+1 \in I.$
Some authors define the set of all integers $>0$ as the smallest inductive set, say Apostol's Analysis. But I am wondering, how to prove that the set of all integers $>0$ is indeed the smallest inductive set under, say the Peano axioms?
Perhaps the most useful way out of this problem is to say it cannot be done.
For, on the one hand, we have a construction of $\Bbb N_{>0}$ given some ambient structure (usually $\Bbb R$ as a complete ordered field) where we have defined $1$ and $+$.
On the other, we have a completely axiomatic description of what $\Bbb N$ is (the distinction between $\Bbb N$ and $\Bbb N_{>0}$ is not really material).
Because the definition of "inductive set" is particular to the former situation, we cannot expect it to carry over to the second because it refers to some ambient properties that we cannot describe using Peano's Axioms.
We can, of course, verify that the construction satisfies the axioms (this is actually an important step in establishing the usefulness of this construction of $\Bbb N$ in $\Bbb R$).
We could also go from $\Bbb N$ and build up $\Bbb Z, \Bbb Q, \Bbb R$, define $1$ and $+$ on this $\Bbb R$ (after having proved it is a complete ordered field), and then reconsider the problem, but this seems to me like a pointless circular exercise.