[see also: rename]
Next we relabel the collection $\{A_n,B_n\}$ as $\{C_n\}$.
Then we can find a subsequence (not relabelled) such that $a_n<1$ for all $n$.
Go to the list of words starting with: a b c d e f g h i j k l m n o p q r s t u v w y z