Countable union of disjoint finite sets is countable

45 Views Asked by At

This statement seems probably true, and for particular examples (e.g. 'all strings of length N in a given alphabet', union over all N) it holds, but I can't find any proof that doesn't rely on the axiom of countable choice, which seems like overkill. Is there a simpler proof?