cragar said:
If the empty set has no elements then how can it have subsets.
Or are we just saying because they don't have anything in them there are equal.
If a set is equal to its subset then why is it a subset.
And How many subsets does the empty set have.
It might be helpful to appeal to the definition of a subset.
We say that A \subseteq B if
\forall x [x \in A \rightarrow x \in B]
In other words if x is an element of A, then x must be an element of B.
Now, let's consider the proposition \emptyset \subseteq \emptyset
Is it true that if x \in \emptyset then x \in \emptyset?
Well, yes. Because this is another one of those vacuous empty set propositions. If x is in the empty set, pretty much anything you can say about x is true. There is no x in the empty set that could falsify the left side of the implication. So the proposition "if x is an element of the empty set, then x is an element of the empty set" is vacuously true.
Therefore, by definition, \emptyset \subseteq \emptyset
For the same reason, every set is a subset of itself. Symbolically, to show that for any given set A, A \subseteq A, we just go back to the definition.
If a \in A, then a \in A. Therefore A is a subset of A.
You are right that that seems a bit strange; and in fact we give a special name to a subset that is not the entire set: we call a subset a
proper subset if it's a subset that's not all of the original set. So A is a subset of A, but not a proper subset of A. And \emptyset is a subset, but not a proper subset, of \emptyset.