Empty Set is Unique/Proof 1

Theorem

The empty set is unique.


Proof

Let $\O$ and $\O'$ both be empty sets.

From Empty Set is Subset of All Sets, $\O \subseteq \O'$, because $\O$ is empty.

Likewise, we have $\O' \subseteq \O$, since $\O'$ is empty.

Together, by the definition of set equality, this implies that $\O = \O'$.


Thus there is only one empty set.

$\blacksquare$


Sources

  • 1971: Robert H. Kasriel: Undergraduate Topology ... (previous) ... (next): $\S 1.3$: Subsets
  • 1978: Thomas A. Whitelaw: An Introduction to Abstract Algebra ... (previous) ... (next): $\S 6.5$: Subsets
  • 1993: Richard J. Trudeau: Introduction to Graph Theory ... (previous) ... (next): $2$. Graphs: Sets
This article is issued from ProofWiki. The text is available under Creative Commons Attribution-ShareAlike License unless otherwise noted. Additional terms may apply for the media files.