In the "traditional" formalism, it matters exactly what you mean by "+1" :-).
People normally define a binary addition relation (two operands -> sum) using a "more fundamental" unary successor relation (one operand -> successor).
Zero is just a constant, and numbers are defined in terms of it and the successor relation: one is "S(0)", two is "S(S(0))" and so on. So if the "+1" in your post is an invocation of the successor function, it certainly is axiomatic (from the axioms of equality):
S(S(0)) = S(S(0))
On the other hand, if we're using actual addition, it might take another step or two, using axioms of addition, like: X + 0 = X, and
S(X + Y) = X + S(Y)
So the proof might go something like S(S(0)) = S(S(0)), by axioms of equality,
S(S(0)) = S(S(0) + 0), by the first axiom above, then
S(S(0)) = S(0) + S(0), by the second axiom above.
And I guess I got lucky that the second axiom was not written S(X + Y) = S(X) + Y
or I'd have been stuck for a day trying to prove that addition is commutative :-).