Cantor's theorem is false. There are no uncountable sets
A sufficiently rich alphabet makes it possible to create a countable set of T = all texts, containing all mathematical works, which, as we know, may sometimes contain very sophisticated characters. The selection of all texts with a specific feature among them, such as defining subsets of natural numbers or defining real numbers is very difficult, but we can always examine selected texts in terms of whether they correctly define the objects of interest to us. Therefore, at the beginning of the created string f I will arbitrarily insert a sequence of several texts ASAB = (T1, T2, T3, T4, T5, T6) instead of the first few digits, which do not define subsets and which will be rejected along with other texts by the verification procedure anyway. And the VP verification procedure consists in checking whether it is possible to specify any number of components of the subsets defined by these texts according to the block diagram: And only texts that pass the verification successfu...