The answer is two because you give a banana to monke you give another banana to monke now monke have 2 banana because you give more than one banana to monke
Define addition as: ∀a∈N,a+0=a∀a∈N,a+0=a and ∀a,n∈N,a+sucn=(a+n)∀a,n∈N,a+sucn=(a+n).
Prove that sucn=n+1sucn=n+1. (n+1=n+suc0=suc(n+0)=sucnn+1=n+suc0=suc(n+0)=sucn).
Therefore, 1+1=suc1=21+1=suc1=2.
Then, prove that in any system which include a subset of inductive number which is compatible with Peano numbers, it is indeed compatible and the definitions of addition, 1, and 2 hold.
Answers & Comments
Answer:
The answer is two because you give a banana to monke you give another banana to monke now monke have 2 banana because you give more than one banana to monke
Explanation
#CarryOnLearning
Define 2 as suc1suc1.
Define addition as: ∀a∈N,a+0=a∀a∈N,a+0=a and ∀a,n∈N,a+sucn=(a+n)∀a,n∈N,a+sucn=(a+n).
Prove that sucn=n+1sucn=n+1. (n+1=n+suc0=suc(n+0)=sucnn+1=n+suc0=suc(n+0)=sucn).
Therefore, 1+1=suc1=21+1=suc1=2.
Then, prove that in any system which include a subset of inductive number which is compatible with Peano numbers, it is indeed compatible and the definitions of addition, 1, and 2 hold.