Let $S=\{a_1,a_2,a_3,\cdots,a_n\}$.
The number of functions from $S$ to $\{0,1\}$ is just $2^n$, since each input of the $a_i$ can have 2 choice of output.
Recall that the number of subsets of a finite set with cardinal number $n$ is just $2^n$. Hence the power set $\mathcal{P}(S)$ of a set $S$ is of cardinality equals to the set of all functions from $S$ to $\{0,1\}$.
Therefore, there is a one-to-one correspondence between the power set $\mathcal{P}(S)$ of a set $S$ and the set of all functions from $S$ to $\{0,1\}$.
Yet I can’t understand why this result implies the theorem 0.14. Can anyone help?