# How does one prove that 1+1=2 [duplicate]

I saw how Russell and Whitehead come to "prove" (may be not, depending on views) that 1+1 = 2. So how does modern logic/set theory prove that 1+1=2? (Is it just that we derive it from Peano axioms, and just say that it is true by axiom..?)

-

## marked as duplicate by Seirios, Stefan Hansen, JSchlather, Davide Giraudo, Michael AlbaneseFeb 18 '13 at 12:33

Under what context are we defining $1$, $2$, and $+$? – peoplepower Feb 18 '13 at 8:51
See this answer and this other answer. – Asaf Karagila Feb 18 '13 at 8:57
I find the combination of your questions quite strange. First you ask about relative constructibility and admissible ordinals. Then you ask about how to prove that $1+1=2$, I'd imagine that the answer to this would be apparent to anyone who solved the first exercise about defining addition for ordinals (which in turn tells you how to prove this in PA). Can you provide some context as for where these questions are coming from? – Asaf Karagila Feb 18 '13 at 9:01

Since I have answered this question in the PA context many times before (many=twice), as the links below can reveal, let me focus on set theory this time. First we need to be clear as to what $1$ and $2$ mean in modern set theory.

In the common von Neumann interpretation, $0=\varnothing; n+1=n\cup\{n\}$. So we have that $1=\{\varnothing\}$ and $2=\{\varnothing,\{\varnothing\}\}$.

Now what does $n+k$ equal? It equals the unique finite number $m$ such that there is a bijection between $m$ and the disjoint union of $n$ and $k$.

In this case it is trivial to see that $1+1=\{\varnothing\}\coprod\{\varnothing\}$ has two elements so we can write the bijection with $2$.