Prove: Given any infinite set S, there exists an uncountable set of infinite subsets of S such that the intersection of any two of these subsets is finite.

from Theory of Computation, Formal Languages, Automata, and Complexity by J. Glenn Brookshear