Exists Subset which is not Element/Proof 1

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $S$ be a set.

Then there exists at least one subset of $S$ which is not an element of $S$.


Proof

Let $S$ be a set.

Let $T$ be the set of all elements of $S$ which do not contain $S$ as elements.

Then by the corollary to Russell's paradox $T$ itself cannot be an element of $S$.

This $T$ is the required subset.


Sources