Infinite Lexicographic Order on Well-Ordered Sets is not Well-Ordering

Theorem
Let $\struct {S, \preceq}$ be a well-ordered set.

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


 * $\tuple {x_1, x_2, \ldots, x_m} \prec \tuple {y_1, y_2, \ldots, y_n}$ :
 * $\exists k: 1 \le k \le \map \min {m, n}$ such that $\forall 1 \le j < k: x_j = y_j$ but $x_k \prec y_k$ in $S$
 * or:
 * $m < n$ and $\forall 1 \le j < m: x_j = y_j$.

Then $\preccurlyeq$ is not a well-ordering on $T$.

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

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

Consider a set $S = \set {a, b}$ such that $a \prec b$.

Then the set $\set {\tuple b, \tuple {a, b}, \tuple {a, a, b}, \tuple {a, a, a, b}, \ldots}$ has no minimal element by $\preccurlyeq$.

Thus $T$ is not well-ordered by $\preccurlyeq$.