Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Does ZF prove that there exists a set S such that S is not in the closure of {{s} : s in S} under at-most-countable unions?
