You just need a definition of 2, of 4 and of +.
Defn: 0 = empty set. 1 = {0}. 2 = {0,1} = {0,{0}}, 3 = {0,1,2} = {0,{0},{0,{0}}},
4 = {0,1,2,3} = {0,{0},{0,{0}}, {0,{0},{0,{0}}}}.
Addition is defined recursively. I.e. first adding one is defined. n + 1 = n union {n}.
i.e. 1+ 1 = {0} union {{0}} = {0,{0}} = 2.
2+1 = 2 union {2} = {0,1} union {2} = {0,1,2} = 3.
3+1 = {0,1,2}+1 = {0,1,2} union {3} = {0,1,2,3} = 4.
Assuming we have defined n+m then n + (m+1) = (n+m)+1.
now you have enough to do it. or keep reading.
So 2 + 2 = (2+1)+1 = 3+1 = 4.
Tata!
Aren’t you glad you asked? Basically it seems 4 = ((1+1)+1)+1. and 2 = (1+1).
so 2+2 = (1+1)+(1+1), so it boils down to associativity of +.