The countable union of countable ordinals is countable, using ZF

94 Views Asked by At

My understanding is that the more general case of this (the countable union of countable sets) requires choice to prove. However in the case of ordinals, it should be provable without choice since there is an explicit well ordering on ordinals. Based on this, how does one go about constructing the explicit surjection needed to prove this?