Clarification prepended below. Essentially the original post follows it.
Whether or not CH is true in V, the well ordering theorem lets us prove there exists a set of reals equinumerous with the countable ordinals, i.e. of cardinality $\aleph_1$; well-order the reals, and then take the reals with only countably-many predecessors in that order. I am saying "reals" because it is more concise than "subsets of $P(\mathbb{N})$", but it is the latter that I care about. As far as I know, this doesn't affect anything significant below.
I have heard the above construction of a set of $\aleph_1$ reals is about as "explicit" as we know how to do, by any means. But of course "explicit" doesn't have a unique precise interpretation. So, I have tried to ask here a precise question that sheds light on that. The question should be a faithful formalization of: Without AC, can you prove there exists a set of reals that is equinumerous with the countable ordinals? Unfortunately, AC is needed to prove some things about the coincidence of equinumerosity and cardinal numbers (see the linked-to stack exchange questions), so we have to be careful about how we formalize the question. I wasn't careful enough in my first go. Here is attempt 2.
Out of an abundance of caution, I will switch to asking about $P(\mathbb{N})$. Let $X<Y$ be the relation: "There is an injection from X to Y and no injection from Y to X." Let A be a sentence in the language of set theory that expresses: There exists $X \subseteq P(\mathbb{N})$ such that $\mathbb{N} < X$ and there is no $Y \subseteq P(\mathbb{N})$ such that $\mathbb{N} < Y < X$.
Then we have a 2-part question:
- Q1: Does ZF prove A?
- Q2: If ZF does not prove A, adding what axiom (as weak as possible) suffices? Ideally, this would be a well-known sentence B such that ZF $\vdash A \iff B$, but any $B$ weaker than $AC$ is helpful.
Original post
I'm attempting to ask roughly if ZF proves the existence of a subset of $\mathbb{R}$ of size $\aleph_1$, while avoiding the language of cardinality in light of complications discussed here: There's non-Aleph transfinite cardinals without the axiom of choice? and Well-orderings of $\mathbb R$ without Choice and Defining cardinality in the absence of choice.
My understanding is that ZF does prove such an X exists if X is not required to be a subset of $\mathbb{R}$ (there exists an uncountable set X all of whose uncountable subsets have bijections with X). I'm assuming that follows in ZF from https://proofwiki.org/wiki/Existence_of_Minimal_Uncountable_Well-Ordered_Set#Proof_Without_Using_Choice, but correct me if I'm wrong.
I've made a couple easy observations. Let A be a sentence in the language of set theory that's clearly equivalent to the question in the title, minus the informal part: there exists an uncountable set of reals X all of whose uncountable subsets have bijections with X.
ZF $\vdash$ A follows from ZF + $\neg$AC + $\neg$CH $\vdash$ A, since AC and CH both separately suffice to prove A. ZF + AC $\vdash$ A using the well-ordering theorem; the reals having only countably-many predecessors in a well-ordering of $\mathbb{R}$ works for X. ZF + CH $\vdash$ A since CH implies $\mathbb{R}$ works for X.
A seems to be equivalent in ZF to "$P(\mathbb{R})$ with the partial order ($X < Y$ iff $X \subset Y$ and there's no injection from Y to X) has no infinite descending chain." I'm not entirely confident in this since ZF not proving the Partition Principle gives me doubts about my ability to sketch a proof from ZF without accidentally using an independent axiom.
If the answer to ZF $\vdash$ A is no, is there a well-known axiom, weaker than AC, that together with ZF suffices to prove A? I had a look at https://en.wikipedia.org/wiki/Axiom_of_choice#Weaker_forms but didn't find one that obviously suffices.