Problem: Given a sequence of $n$ natural numbers $a_1,a_2,...,a_n$ with $1<a_i<(2n-1)^2$, $(i=\overline{1,n})$ and $i < j \iff a_i < a_j$. If all of the terms are pairwise coprime, show that at least one of them must be prime.
My try: (based on weak arguments)
Claim: $p_n \ge 2n-1$ (i.e. $n^\text{th}$ prime number is not less than $n^\text{th}$ odd number).
Proof: $\square$ Trivial to check for some initial $n$'s:$$p_1=2 \ge 1$$ $$p_2=3 \ge 3$$ $$p_3=5 \ge 5$$ $$...$$ Now, since $p_{i+1} - p_i \ge 2 \ \ (\forall ~ i \ge 2)$ but the difference between any two consecutive odd numbers is $2$, the claim is obvious. $\blacksquare$
For the sake of contradiction, assume that there is no prime in them. Since $\gcd(a_i,a_j)=1, \ \ (i\neq j)$, all terms of the sequence must have distinct prime factors. As we do not want to be run out of prime factors that are less than $2n-1$, we better assume $a_i=p_i^2$ (if we can prove that the original statement is true for this case, then it is true in general since for any other construction of $a_i'$ we will have $a_i<a_i'$).
Then, $a_n = p_n^2$, but the claim implies $a_n=p_n^2 \ge (2n-1)^2$. A contradiction.
Therefore, at least one of the terms must be prime.
However, this "solution" seems to have many errors yet I cannot fix. I think I started approaching in the wrong way.
Any help is appreciated.