Theorem 2.12 — a countable union of countable sets is countable
ProvedRudin.ch02_countable_unionIf is a sequence of countable sets, then is countable. (Rudin's 'countable' allows finite sets, which is Mathlib's Set.Countable.)
import Mathlib
namespace Rudin
/-- Rudin, Theorem 2.12: the union of a sequence of countable sets is countable. -/
theorem ch02_countable_union {X : Type*} (E : ℕ → Set X) (h : ∀ n, (E n).Countable) :
(⋃ n, E n).Countable := by sorry
end RudinRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Let be an arbitrary type (no structure assumed) and let be a sequence of subsets of indexed by the natural numbers. If every is countable — meaning finite or countably infinite, i.e. admitting an injection into — then the union
is countable as well.
The index set is exactly ; the sets are not assumed disjoint, nonempty or distinct, so finite unions are covered by repeating sets, and the empty union case is excluded only in the sense that the index set is nonempty. The conclusion "countable" here includes the possibility that the union is finite.
Confirmed by the mission captain (proposal self-audit).