For every set $A$, the empty set is a subset of $A$. The empty set is a set. Therefore, the empty set has a cardinality $\geq 1\ldots$ I have only recently been exposed to sets. According to Wikipedia, as seen on the first bullet mark of the link, $ \forall A: \emptyset \subseteq A$
Does this mean that $\emptyset$ is an element of all sets? (This is False, thank you those that answered)
Is the empty set also a set itself?
Assuming these statements are true, then the empty set therefore an element of the empty set. This does not sound right, please clarify for me. Thank you.
 A: Being a subset and being an element are different. For every set $A$, $\varnothing\subseteq A$, but not necessarily $\varnothing\in A$. As an example, we can consider $$A=\left\{1,2,3,\{1,2\}\right\}\text{ and }B=\{1,2,3\}.$$ Then $\{1,2\}\in A$ AND $\{1,2\}\subseteq A$ whereas $\{1,2\}\subseteq B$ but $\{1,2\}\notin B$. Hopefully this clarifies that being an element and a being a subset are different things.
A: $\varnothing$ is a subset of $\varnothing$, but $\varnothing$ is a not an element of $\varnothing$, because $\varnothing$ has no elements by definition.  
For every set $A$, there is no element of $\varnothing$ that is not in $A$, and therefore $\varnothing\subseteq A$.  This is true whether or not $A$ is empty.
For an example of a nonempty set that doesn't have the empty set as an element, consider the set $A=\{\{1\}\}$.  That is, $A$ is the set whose only element is the set $\{1\}$.  Because $\{1\}$ contains the element $1$, it is not empty, $\{1\}\neq\varnothing$.  Because the only element of $A$ is not $\varnothing$, $\varnothing\not\in A$.  The set $\{\{\varnothing\}\}$ also does not have the empty set as an element for the same reason. On the other hand, the set $\{\varnothing\}$ does have the empty set as an element.  By definition, $\varnothing$ is the only element of the set $\{\varnothing\}$.
A: The empty set is indeed a set (the set of no elements) and it is a subset of every set, including itself. $$\forall A: \emptyset \subseteq A,\;\text{ including if}\;\; A =\emptyset: \;\emptyset \subseteq \emptyset$$
$$\text{BUT:}\quad\emptyset \notin \emptyset \;\text{ (since the empty set, by definition, has no elements!)}$$ 
That is, being a subset of a set is NOT the same as being an element of a set: $$\quad\subseteq\;\, \neq \;\,\in: \;\; (\emptyset \subseteq \emptyset), \;\;(\emptyset \notin \emptyset).$$
$\emptyset \;\subseteq \;\{1, 2, 3, 4, 5\},\quad$  whereas $\;\;\emptyset \;\notin \;\{1, 2, 3, 4, 5\},\;$.  
$\{3\} \subseteq \{1, 2, 3, 4, 5\},\quad$ whereas $\;\;3 \nsubseteq \{1, 2, 3, 4, 5\}, \text{... but}\; 3 \in \{1, 2, 3, 4, 5\}$.
A: Sorry to clutter the site with yet another answer to the many good ones already posted, but I'd like to offer one that is a bit more formal. 
The empty or null set, $\emptyset$, is defined as a set that has no elements. A set $A$ is said to be a subset of $B$ if and only if every element of $A$ is also an element of $B$, notation $A \subseteq B$, or stated using predicate logic,
$$\forall x(x \in A \rightarrow x \in B)$$
So to claim that the null set is a subset of any other set asserts $$\emptyset \in \emptyset \rightarrow \emptyset \in A$$ The logical proof of this simply observes that the antecedent of the implication is false therefore the implication is vacuously true. It is false because the definition of the empty set is one that contains no elements and therefore it does not contain itself. Since we have satisfied the definition of subset, we have proven the claim that the empty set is a subset of every set regardless of how counter intuitive it may be. 
Hey, that's logic!
