But a theorem of Sageev says that $\ldots$
I don't want to alter Andreas's answer, but I want to add a reference to one of the results he mentions.
Sageev, Gershon
An independence result concerning the axiom of choice.
Ann. Math. Logic 8 (1975), 1-184.
Here are the first few lines of the Math Review (written by Andreas Blass) for this 184-page paper:
In 1924, A. Tarski [Fund. Math. 5 (1924), 147–154; Jbuch 50, 135] asked whether the idemmultiple hypothesis, $2m=m$ for all infinite cardinals $m$, implies the axiom of choice. The author answers this question negatively by constructing a model of Zermelo-Fraenkel set theory in which the idemmultiple hypothesis, the ordering principle (every set can be linearly ordered), and the axiom of $\aleph_0$-multiple choice (for any family of nonempty sets, there is a function assigning to each set in the family a countable subset) hold but there is a countable family of sets of reals with no choice function.
The model constructed in Sageev's paper is called $N$. On page 148, Sageev proves
9.30. Lemma.
Every $z \in N$ is orderable in $N$; and if $z$ is infinite, then $z$
is idemmultiple in $N$.
A function $I$ is defined in Notation 10.00 on page 164. Then, on pages 181-182, Sageev states and proves:
10.60. Lemma. There is no choice function in $N$ for the set $\{I(i)\;|\; i < \omega\}$.