In article <firstname.lastname@example.org>, email@example.com wrote:
> On Tuesday, 25 June 2013 17:07:36 UTC+2, dull...@sprynet.com wrote: > >> There are not uncountably many reals, neither in the natural order nor in > >> the well-order. > > > > That's very funny. > > That's easily provable: > > Consider a Cantor-list that contains a complete sequence (q_k) of all > rational numbers q_k. The first n digits of the anti-diagonal d are > d_1, d_2, d_3, ..., d_n. It can be shown *for every n* that the Cantor- > list beyond line n contains infinitely many rational numbers q_k that > have the same sequence of first n digits as the anti-diagonal d.
Thus at most proving that one countable set of rationals surjects onto another countable set of rationals, but does no more than that. >
> For all n exists k: > d_1, d_2, d_3, ..., d_n = q_k1, q_k2, q_k3, ..., q_kn.
So what? That does not prove that there exists any k for all n.