Metamath Proof Explorer


Theorem unictb

Description: The countable union of countable sets is countable. Theorem 6Q of Enderton p. 159. See iunctb for indexed union version. (Contributed by NM, 26-Mar-2006)

Ref Expression
Assertion unictb A ω x A x ω A ω

Proof

Step Hyp Ref Expression
1 uniiun A = x A x
2 iunctb A ω x A x ω x A x ω
3 1 2 eqbrtrid A ω x A x ω A ω