My previous post is wrong.
It has to be as follows:
By carefully observe
this diagram I realized that every sequence of bits in its left side, has a complement in its right side and vise versa, such that no matter how many bits are involved, the complement property is invariant, which guarantees the uniqueness of each sequence along the tree.
By carefully observe these notions I have found the following:
The first finite level (the one that includes two bits) of The Infinite Binary, needs cardinal number with
1 place in order to represent
21 cardinal numbers.
The second finite level of The Infinite Binary, needs cardinal number with
2 places in order to represent
22 cardinal numbers, such that
2 =
21
The third finite level of The Infinite Binary, needs cardinal number with
3 places in order to represent
23 cardinal numbers, such that
3 <
22
The forth finite level of The Infinite Binary, needs cardinal number with
3 places in order to represent
23 cardinal numbers, such that
4 <
23
...
The first infinite level of The Infinite Binary, needs cardinal number with
ℵ0 places in order to represent
2ℵ0 cardinal numbers.
The second infinite level of The Infinite Binary, needs cardinal number with
ℵ1 places in order to represent
2ℵ1 cardinal numbers, such that
ℵ1 =
2ℵ0
The third infinite level of The Infinite Binary, needs cardinal number with
ℵ2 places in order to represent
2ℵ2 cardinal numbers, such that
ℵ2 <
2ℵ1
The forth infinite level of The Infinite Binary, needs cardinal number with
ℵ3 places in order to represent
2ℵ3 cardinal numbers, such that
ℵ3 <
2ℵ2
...
etc.
---------------------
Since the observation above holds for any base (finite or infinite, where the invariant complementary property is taken as an average between trees' left and right sides) GCH is solved.
So The Infinite Binary Tree is some case without loss of generality.