Each element of an -element set is either in a subset or out of it, so there are subsets in all. Conditions change only the number of free choices: a fixed size uses , a forced element removes one choice, and "at least one" is counted from its opposite.
| Step | On subsets of that contain but not | |
|---|---|---|
| 1 | Count the elements. Every element of the set is one in or out choice. | |
| 2 | Fix the forced elements. An element that must be in, or must be out, has no choice left. | in, out: |
| 3 | Give each free element two choices. In or out, independently of the others. | |
| 4 | Compute and adjust for the wording. Subtract for "proper" (the set itself) or for "nonempty" (the empty set), if the question says so. | subsets |