Find the number of the elements for each set. $\emptyset$ , $\{\emptyset\}$ , $\{\{\emptyset\}\}$, $\{\emptyset, \{\emptyset\}\}$

Supoose that we want to enumerate the elements contained in the below sets

(a) $$\emptyset$$ , (b) $$\{\emptyset\}$$ , (c) $$\{\{\emptyset\}\}$$, (d) $$\{\emptyset, \{\emptyset\}\}$$

The question is simple. How many elements contain each set?

My solution: The first set is the empty set so it contains 0 elements. The second set contains an empty set, consequently, contains 1 element. The third one contains 1 element because contains a set which set contains the empty set. Finally, the last one contains 2 elements. The empty set and the set that contains an empty set. Is this solution correct ?

My mind bleeds !!!

• Yes. Your answers are correct. What helps for me is to have a very firm grasp that a collection (a set) as a specific thing, is a completely different thing and and different concept then the things within the collections as things. A registry of gym members is not the people who are members of the gym. And the reference books inside a reference library is not the library itself. – fleablood Nov 18 '18 at 19:23
• I usually tell the students who struggle with all of the bracketing that unless it is the empty set, there is at least one element, so the number of elements is the number of commas +1. This is obviously not applicable to most sets, but it is a nice intuition builder. – Don Thousand Nov 18 '18 at 23:58