Let $(\mathbb{Q},<)$ be the usual ordering of rationals. Show that there is a family $\mathcal F$ of subsets of $\mathbb{Q}$ such that $|\mathcal F|=2^\omega$ and for every $A, B \in \mathcal F, (A,<)\ncong (B,<).$
I know that the question is asking to find a family $\mathcal F$ such that it is an uncountable set as $2^\omega \geq \omega_1.$
Also in order to show that $(A,<)\ncong (B,<)$, i need to show that there is no bijection $f: A \to B$ such that for every $x,y\in A$, $x<y \iff f(x)<f(y)$.
I am unsure of how to do this construction.
For a given set $X\subseteq\mathbb N$ let $$A_X=\left(\mathbb Q\setminus\bigcup_{n\in\mathbb N}\left(n-\frac13,n+\frac13\right)\right)\cup X.$$ There are $2^\omega$ different subsets $X\subseteq\mathbb N$, and $X\ne Y\implies A_X\not\cong A_Y$.