Is the class of cardinals totally ordered? In a Wikipedia article
http://en.wikipedia.org/wiki/Aleph_number#Aleph-one
I encountered the following sentence:
"If the axiom of choice (AC) is used, it can be proved that the class of cardinal numbers is totally ordered."
But isnt't the class of ordinals totally ordered (in fact, well-ordered) without axiom of choice? Being a subclass of the class of ordinals, isn't the class of cardinals obviously totally ordered? 
 A: The statement that the class of cardinals is a subclass of the class of ordinals is equivalent to the axiom of choice.
A: The ordinals are well ordered regardless to any assumption of choice. It is defined that the class of ordinal numbers is the smallest transitive class that can be well ordered, and they form a backbone of transitive models, that is if $M,N$ are two transitive models have the same ordinals then $L^M=L^N$.
Without the axiom of choice there are non-well orderable sets. Their cardinality, if so, is not an $\aleph$ number. We define the cardinality of $X$ as either finite, or $\aleph_\alpha$ for some ordinal $\alpha$, in case that $X$ can be well ordered; or as a definable subset of the class of $A$'s such that there is a bijection between $X$ and $A$.
For example, it is consistent with ZF that there are infinite sets that cannot be split into two infinite sets (every partition into two disjoint sets will yield one of them finite). Such set does not even have a countable subset and therefore incomparable with $\aleph_0$.

To see how total order of cardinals is equivalent to the axiom of choice:
If the axiom of choice holds, then every set can be well ordered and is finite or equivalent to some $\aleph$-cardinal. Therefore all cardinals are $\aleph$'s and so cardinals are totally ordered (and well ordered too).
On the other hand, if cardinals are totally ordered, given a set $X$ denote $H(X)$ the least ordinal $\alpha$ such that there is no injective function from $\alpha$ into $X$. 
It can be shown that $\alpha$ is an $\aleph$ cardinal (by the fact it has no bijection with smaller ordinals which are injectible into $X$), and $\alpha\nleq|X|$.
By the assumption that cardinalities of all sets are comparable $|X|$ is comparable with $\alpha$, therefore $|X|<\alpha$, and we have that $X$ can be injected into $\alpha$ and so it inherits a well order from such injection. 
Therefore all sets can be well ordered, which is equivalent to the axiom of choice.
(The term for which I used for $H(X)$ is also known as Hartogs number)
A: A cardinal number is a non-negative integer or an $\aleph$ number, and yes, the cardinal numbers are totally ordered.  By this definition, which is fairly standard as far as I know, a cardinal number is any ordinal number $\sigma$ from which no injective function exists to any ordinal number $\tau\subsetneqq\sigma$.  Thus $\aleph_0=\omega_0$, $\aleph_1=\omega_1$, etc.
The cardinality of a set is a slightly more subtle concept: we say that the cardinality of a set A is less than or equal to that of a set B if there exists a one-to-one (or injective) function f from A to B.  We express this mathematically as follows:
$$|A|\le|B|\leftrightarrow \exists f:A\xrightarrow{1-1}B$$
Clearly the existence of such a one-to-one function is a reflexive, transitive relation.  By the Cantor-Bernstein theorem,
$$\left(\exists f:A\xrightarrow{1-1}B\right)\land\left(\exists g:B\xrightarrow{\rm 1-1}A\right)\rightarrow \left(\exists h:A\xrightarrow{\rm 1-1,\ onto}B\right).$$
Therefore if A and B are sets, such $|A|\le|B|$ and $|B|\le|A|$, then there is a one-to-one and onto function (called a bijection) from A to B.  We say that $|A|=|B|$ in this case, and the class of all sets is partitioned into equivalence classes by this relation.  The cardinality of a set is defined to be its equivalence class under this relation $|\cdot|=|\cdot|$.  These equivalence classes are always partially ordered by the relation $|\cdot|\le|\cdot|$ on the underlying sets.
So far I have not assumed the axiom of choice:  if we accept the axiom of choice, then the equivalence classes of cardinality are totally ordered, one and only one cardinal number being an element of each class.  Without the axiom of choice, the equivalence classes of cardinality are not totally ordered.
See proof by Asaf and my question The axiom of choice in terms of cardinality of sets.
A: If I understand the problem correctly, it depends on your definition of cardinal. If you define the cardinals as initial ordinals, then your argument works fine, but without choice you cannot show that every set is equinumerous to some cardinal. (Since AC is equivalent to every set being well-orderable.)
On the other hand, if you have some definition which implies that each set is equinumerous to some cardinal number, then without choice you cannot show that any two sets (any two cardinals) are comparable. (AC is equivalent to: For two sets $A$, $B$ there exists either an injective map $A\to B$ or an injective map $B\to A$. It is listed as one of equivalent forms if AC at wiki.)
