>>363
(引用開始)
>これが 理解できていれば、選択関数は
>整列可能定理の 関係R の構成を通じて 具体化可能だ！と
じゃあ実数の整列順序を構成してみて
整列可能定理でできるんでしょ？
(引用終り)

その議論、下記のIn 1905 Kőnig の議論にある通りです
120年前の議論、ご苦労さまですｗ ；ｐ）

(参考)
en.wikipedia.org/wiki/Gyula_K%C5%91nig
Gyula Kőnig (16 December 1849 – 8 April 1913) was a mathematician from Hungary. His mathematical publications in German appeared under the name Julius König.

Kőnig and set theory
he published a paper that claimed to prove that not all sets could be well-ordered.
Contrary to Cantor, presently the majority of mathematicians considers undefinable numbers not as absurdities.
This assumption leads, according to Kőnig,
in a strangely simple way to the result that the continuum cannot get well-ordered. If we imagine the elements of the continuum as a well-ordered set, those elements which cannot be finitely defined form a subset of that well-ordered set which certainly contains elements of the continuum. Hence in this well-order there should be a first not finitely definable element, following upon all finitely definable numbers. This is impossible. This number has just been finitely defined by the last sentence. The assumption that the continuum could be well-ordered has led to a contradiction.

Kőnig's conclusion is not stringent. His argument does not rule out the possibility that the continuum can be well-ordered; rather, it rules out the conjunction of "the continuum can be well-ordered by a definition in language L" and "the property of being definable in language L is itself definable in language L". The latter is no longer generally held to be true. For an explanation compare Richard's paradox.

つづく