I'm reading a book and this I've been stuck on this proof for hours:
I cant understand what set is $V$ and what set is $W.$ $V$ is the set of all the subsets of $S$ (the power set) "and $a_{n+1}\notin S$" what does that "and .." mean? I don't really get it, is it $S$ without $a_{n+1}$?
Then, another question, I don't really understand that function, if $s_n=\{1,2\}$, for example, then its power set is $\mathcal{P}(S_n)=\{\phi, \{1\}, \{2\}, \{1, 2\}\}$, now this is the domain of that function, and the range is $\{\{3\}, \{1, 3\}, \{2, 3\}, \{1, 2, 3\}\}$ but how is this the same as "a mapping from $V$ onto $W$"?? maybe I don't understand this because I don't understand how $V$ and $W$ are defined.

What characterizes a subset of $S$? It is a set $ T$ of elements each of which belons to $S.$ So how do you build such a $T$ from $S?$ You look at every member of $S$ and ask "Does this member belong to $T$? The answer is "Yes" or "No." Since $S$ contains $n$ members the number of different possibilities for "yes"or "No","yes"or "No",...,"yes"or "No" is $2\times2\times\dots\times2=2^n$ because there are $n$ $2$'s in the product. So the number of subsets of S is $2^n.$