It is possible to build a sequence of elements s0 in such a way that its first element is different from the first element of the first sequence in the list, its second element is different from the second element of the second sequence in the list, and, in general, its nth element is different from the nth element of the nth sequence in the list. That is to say, if sm,m is 1, then s0,m is 0, otherwise s0,m is 1. For instance:
s1 = (0, 0, 0, 0, 0, 0, 0, ...)
s2 = (1, 1, 1, 1, 1, 1, 1, ...)
s3 = (0, 1, 0, 1, 0, 1, 0, ...)
s4 = (1, 0, 1, 0, 1, 0, 1, ...)
s5 = (1, 1, 0, 1, 0, 1, 1, ...)
s6 = (0, 0, 1, 1, 0, 1, 1, ...)
s7 = (1, 0, 0, 0, 1, 0, 0, ...)
...
s0 = (1, 0, 1, 1, 1, 0, 1, ...)
(The elements s1,1, s2,2, s3,3, and so on, are here highlighted, showing the origin of the name "diagonal argument". Note that the highlighted elements in s0 are in every case different from the highlighted elements in the table above it.)
Therefore it may be seen that this new sequence s0 is distinct from all the sequences in the list. This follows from the fact that if it were identical to, say, the 10th sequence in the list, then we would have s0,10 = s10,10. In general, if it appeared as the nth sequence on the list, we would have s0,n = sn,n, which, due to the construction of s0, is impossible.
From this it follows that the set T, consisting of all infinite sequences of zeros and ones, cannot be put into a denumerable list s1, s2, s3, ... Otherwise, it would be possible by the above process to construct a sequence s0 which would both be in T (because it is a sequence of 0s and 1s which is by the definition of T in T) and at the same time not in T (because we can deliberately construct it not to be in the list). T, containing all such sequences, must contain s0, which is just such a sequence. But since s0 does not appear anywhere on the list, T cannot contain s0.
Therefore T cannot be placed in one-to-one correspondence with the natural numbers. In other words, it is uncountable.
The interpretation of Cantor's result will depend upon one's view of mathematics. To constructivists, the argument shows no more than that there is no bijection between the natural numbers and T. It does not rule out the possibility that the latter are subcountable. In the context of classical mathematics, this is impossible, and the diagonal argument establishes that, although both sets are infinite, there are actually more infinite sequences of ones and zeros than there are natural numbers.