Countably complete ultrafilter
= Countably complete ultrafilter
An ultrafilter is countably complete when the intersection of every countable family of its members again belongs to it. Equivalently, whenever the underlying set is partitioned into countably many pieces, exactly one piece belongs to the ultrafilter.