Maybe there's some other technical obstacle I'm missing here
There's not. The Hartog's number construction gives us the set H(N) of all isomorphism classes of well-orders on subsets of any fixed countably infinite set, and we can prove that H(N) is uncountable and every proper initial segment of H(N) is countable, using power set and separation (but only bounded separation) but not replacement. I verified this just now by looking at Wikipedia's article on Hartog's number and checking through the proof myself.
The next step (step 4 in Wikipedia, ETA: which can be saved for the end, although WP did not do so) is to replace the elements of H(N) with von Neumann ordinals, but this is really beside the point. You already have a representation of the least uncountable ordinal, and this step is just making it canonical in a certain way.
Heh, I'd forgotten how simple Hartogs number was in general.
Update: Discussion has moved on to a new thread.
The hiatus is over with today's publication of chapter 73, and the previous thread is approaching the 500-comment threshold, so let's start a new Harry Potter and the Methods of Rationality discussion thread. This is the place to discuss Eliezer Yudkowsky's Harry Potter fanfic and anything related to it.
The first 5 discussion threads are on the main page under the harry_potter tag. Threads 6 and on (including this one) are in the discussion section using its separate tag system. Also: one, two, three, four, five, six, seven. The fanfiction.net author page is the central location for information about updates and links to HPMOR-related goodies, and AdeleneDawner has kept an archive of Author's Notes.
As a reminder, it's often useful to start your comment by indicating which chapter you are commenting on.
Spoiler Warning: this thread is full of spoilers. With few exceptions, spoilers for MOR and canon are fair game to post, without warning or rot13. More specifically: