Here is my write up of the same proof... what am I getting wrong?
Given that $CH \rightarrow \omega_1$ can be well ordered, let $\langle X_{\alpha} \ | \ \alpha < \omega_1 \rangle$ denote a well ordering of all subsets $X \subseteq \omega$. We will create sets $T_{\beta} \subseteq \omega$ by recursion as follows:
Step 0: $T_0 = \emptyset$
...
Step $\beta$: For all $X_{\alpha}$ with $\alpha < \beta$ find some $x_{\alpha,\beta}, y_{\alpha,\beta} \in X_{\alpha}$ in such a way that we can place $x_{\alpha,\beta} \in T_{\beta}$ and claim $y_{\alpha,\beta} \notin T_{\beta}$ for all $\alpha < \beta$.
Now we can define the desired $T$ as follows:
$$ T = \bigcup_{\beta < \omega_1}\{\beta\} \times T_{\beta}$$
Now consider an arbitrary large rectangle $S \subseteq \omega_1 \times \omega$. Looking at only the $\omega$ components of $S$, call it $B$, we can say $B = S_{\alpha}$ for some $\alpha < \omega_1$. For all $\beta > \alpha$ we have some $x_{\alpha,\beta} \in S_{\alpha}$ and $x_{\alpha,\beta} \in T_{\beta}$. Because $A$ is uncountable and $B$ is countably infinite, we can find a $(\tau, x_{\alpha,\beta})$... and I'm stuck...