I'm reading Guerino Mazzolla's Comprehensive Mathematics for Computer Scientists 1:
Axiom 3 (Axiom of Union) If $a$ is a set, then there is a set
$$\{x| \text{ there exists an element } b \in a \text{ such that } x\in b \}$$
This set is denoted by $\cup a$ and is called the union of $a$.
$ $
Lemma 1 For any set $a$, there is the set $a^+=a\cup \{a\}$. It's called the successor of $a$.
$\emptyset^+=\emptyset \cup \{ \emptyset \}$ can be rewritten as $\bigcup \{\emptyset, \{\emptyset \} \}$, then applying the axiom of union, there are two elements $b\in a$:
- $\emptyset$ and $\{\emptyset \}$
And then when applying $x\in b$, I'm having trouble because the book states that the empty set is the set with no elements inside it. But somehow it seems reasonable that $\emptyset \in \emptyset$, then I could proceed:
$\emptyset^+=\{\emptyset,\{\emptyset \} \}$
$\{\emptyset,\{\emptyset \} \}^+= \bigcup \{\{\emptyset,\{\emptyset \} \},\{\{\emptyset,\{\emptyset \} \} \} \}= \{\emptyset,\{\emptyset \},\{\emptyset,\{\emptyset \} \} \}$
I've also made an experiment with Mathematica that seems to confirm my hypothesis:
a = {}
a \[Union] {a}
(a \[Union] {a}) \[Union] {a \[Union] {a}}
((a \[Union] {a}) \[Union] {a \[Union] {a}}) \[Union] {(a \[Union] {a}) \[Union] {a \[Union] {a}}}
Which yields:
{}
{{}}
{{}, {{}}}
{{}, {{}}, {{}, {{}}}}