I'm stuck on a problem using recursive definitions:
Let $X$ be a finite set. Give a recursive definition of the set of all subsets of $X$. Use Union as the operator in the definition.
I can see how the union of all subsets separately gives a set of all subsets, but I don't understand how to prove it. I'm not even sure what the base case would be in this situation.