Lexicographic Order on Products of Well-Ordered Sets

Theorem
Let $S$ be a set which is well-ordered by $\preceq$.

Let $\preccurlyeq$ be the lexicographic order on the set $T$ of all ordered tuples of $S$.

Then:
 * $(1): \quad$ For a given $n \in \N: n > 0$, $\preccurlyeq$ is a well-ordering on the set $T_n$ of all ordered $n$-tuples of $S$;
 * $(2): \quad \preccurlyeq$ is not a well-ordering on the set $T$ of all ordered tuples of $S$.

Proof
It is straightforward to show that $\preccurlyeq$ is a total ordering on both $T_n$ and $T$.

It remains to investigate the nature of $\preccurlyeq$ as to whether or not it is a well-ordering.