A diagonalization example
I found the argument below on MathReference archive
all the finite sets of integers are countable, but not so for the infinite subsets. Here is a simple diagonalization argument. If the infinite sets are countable then the correspondence builds a list of all possible subsets. Build a new subset S as follows. Let n be in S iff n is not in the nth subset on the list. Therefore S cannot appear anywhere on the list. If S is in position n, then S contains n iff it doesn't. Every possible correspondence fails, because it misses some set S.
The bold part does not make sense to me. Could you please give me an explanation of that part? I would really appreciate that.