Cantor's construction of $\aleph_1$ is to notice that all ordinals constructed after $\omega$ are countable, take the union of all countable ordinals, and then show that this union can not be countable. However, in ZFC the union can only be taken over a set. I can see how to relate countable ordinals to elements of $2^{\aleph_0}$ proving that their collection is a set by specification, but that requires the power set axiom. The "slicker" modern way, declaring $\aleph_1$ to be the least uncountable cardinal, already presupposes the existence of uncountable cardinals. That's even worse since in addition to power set one needs choice to prove that $2^{\aleph_0}$ is an aleph, and then it is greater by the diagonal argument.
It wouldn't surprise me that some voodoo with collection or replacemnt schemas does the trick, but then my question is what does it translate to in "naive" terms of Cantor? What reason do we have for the collection of countable ordinals to be a set (without invoking formulas in the first order logic and definable functions)? If power set isn't required why can't Cantor's argument be reproduced to create inaccessible cardinals by noticing that all cardinals produced after $\aleph_0$ are, by construction, accessible?