Let's prove that, if a set has size \(n\), then that same set has exactly \(2^n\) subsets.
Are monsters good at maths? Not really, unless you Count Dracula.