> Infinite essentially mean unknown. How could you possible compare the size of two unknowns?
The point is, that's not really what infinite means. A set being infinite just means that we can start listing elements, and we'll always be able to find a new element that we haven't listed before.
To compare two infinite sets A and B, we can consider functions F that take any element from A and output some element from B.
If A and B have the same cardinality, then we can always describe a certain function F that can potentially output any element from B, if we know the right input from A.
But if B has a greater cardinality than A, then we cannot find any such function. No matter which function F we choose, there will always be certain values in B that can never be output by F given any input in A. Thus, we say that B has "more elements" than A in a certain sense.
In the case of Cantor's argument, A is the set of natural numbers, B is the set of real numbers, and F is the ordering we choose.
A variation of Cantor's argument can be expressed fully in terms of finite objects. Suppose we have a function F such that F(i) = f_i, where f_i is a function such that f_i(j) represents the jth digit of the ith real number in the sequence.
Then, we can write a new function g(j) = (F(j)(j) + 2) mod 10, or some variation. This function g(j) similarly represents a real number.
Now, we can take any i we want and start comparing f_i(1) vs. g(1), f_i(2) vs. g(2), etc. After a finite amount of time, we'll always reach a point where the two functions differ. This means that the two functions represent two different real numbers.
Therefore, the real number represented by g is not represented by any of the f_i, no matter which function F we start with.