The power set is the set of all subsets of . List them in an order that cannot miss any: by size from the empty set up, or by doubling the list each time a new element is added. A set with elements has subsets, which checks the list.
| Step | On | |
|---|---|---|
| 1 | Count the elements. A set with elements has subsets; this is the target count. | , so subsets |
| 2 | Start with the empty set. The empty set is a subset of every set. | |
| 3 | List the subsets by size. All singletons, then all pairs. Write each subset once; the order inside its braces does not matter. | |
| 4 | End with the set itself and check the count. Every set is a subset of itself. Count the entries against . |