First part:
Prove that there's an infinite family $\mathscr{A}\subseteq P(\omega)$ such that:
- $X \in \mathscr{A} \Rightarrow |X|=\aleph_0$
- $(X,Y\in \mathscr{A} \wedge X\ne Y)\Rightarrow |X \cap Y|<\aleph_0$
- $\forall Z\subseteq \omega$, if $|Z|=\aleph_0$ then $\exists X\in \mathscr{A}$ such that $|X\cap Z|=\aleph_0$.
Second part:
Prove that $\mathscr{A}$ is not countable.
I've started the first part with Zorn's lemma, but when I get a promised maximum of the set $S=\{\mathscr{A}\subseteq P(\omega) : \mathscr{A}\ meets\ the\ 3\ conditions\}$ with the $\subseteq$ relation I can't know weather $\mathscr{A}$ is finite or infinite.
Maybe the solution is through [ultra]filters, compactness theorem or transfinite induction instead of Zorn's lemma. What do you think?
No, Zorn's lemma is plenty.
The trick, however, is to start with an uncountable family $\scr B$ satisfying (1) and (2), and define the partial order $S$ of all $\scr A$ such that $\scr B\subseteq A$ and the conditions hold.
However, we can also notice the following trend: either $\scr A$ is finite, e.g. if it is $\scr A=\{\omega\}$, or $\scr A$ is uncountable.
Suppose that $\scr A$ was countably infinite, say $\{A_n\mid n<\omega\}$, let $a_{n,m}$ be the increasing enumeration of $A_n$ for $m<\omega$. Then define $x_n$ to be the least $a_{n,m}$ such that $a_{n,m}\notin A_k$ for all $k<n$. Using the finite intersections, we can prove that such $m$ exists, so $x_n$ is well-defined.
Now $X\cap A_n$ must be finite, so condition (3) must fail.