TylerH said:
I'd like to see a proof for the 2nd.
The abstract way that I've learned in class is:
First show that [itex](N, s(n), 1)[/itex] to be a Peano space.
By the Recursion Theorem we can define for each [itex]m\in N[/itex] the function [itex]f_m : N\to N[/itex] as follows: [itex]f_m (1)=s(m)[/itex], and [itex]f_m (s(n))=s(f_m(n)),\, \forall n\in N[/itex]. We then define a binary operation on N, which we call [itex]addition[/itex] and denote by "[itex]+[/itex]". For each [itex](m,n)\in P\times P[/itex], we define [itex]m+n[/itex] to be [itex]f_m (n)[/itex]. We also call [itex]m+n[/itex] the [itex]sum[/itex] of [itex]m[/itex] and [itex]n[/itex].
Note we have then: [itex]f_m (1)=s(m)=m+1[/itex] and [itex]m+(n+1)=f_m (s(n))=s(f_m (n))=(f_m (n))+1=(m+n)+1[/itex]
(We're almost there)
Claim: [itex]k+(m+n)=(k+m)+n,\,\,\forall k,m,n\in N[/itex] (Associativity of Addition)
[itex]Proof.[/itex] We will use induction on [itex]n[/itex]. Let [itex]P(n):=k+(m+n)=(k+m)+n[/itex]. [itex]P(1)[/itex] is true by definition. So suppose [itex]P(n)[/itex] is true, we must show [itex]P(n)\implies P(n+1)[/itex].
So:
[itex]
k+[m+(n+1)]=k+[(m+n)+1]=[k+(m+n)]+1=[(k+m)+n]+1=(k+m)+(n+1).[/itex]
Where the first, second, and fourth equality are by definition, and the third is the inductive step.
-----
By showing [itex]N[/itex] to be a Peano space, you can prove that induction 'works' on it, and can therefore show the operation of addition to be associative [itex]\forall n\in N[/itex] by the previous proof.
Obviously this way is too abstract and complicated for elementary or high school. So the most intuitive way would be to just explain what induction is and use it.
EDIT: Definition of a Peano space can be found
https://www.physicsforums.com/showthread.php?t=518053", (within PF). The proof that there exist's a Peano space can be typed up if anyone is interested, as well as how [itex](N, s(n)=n+1, 1)[/itex] is a Peano space; which would be sufficient to hold the background to these definitions and claim.
References:
https://www.amazon.com/dp/0763727334/?tag=pfamazon01-20