I wanted to prove the fact for which I have a sketch of proof: Let $(W,\leq )$ be a well-ordered set and $U$ be a subset of $W$. Then considering the restriction of $\leq $ to $U\times U$, we have that $U$ is isomorphic to an initial segment of $W$ or it is isomorphic to $W$.
A natural proof would be as follows: We shall define an order-embedding $f:U\rightarrow W$ such that $f(U)$ is $W$ or an initial segment of $W$. Send the least element of $U$ to the least element of $W$. Assume that $f$ is defined for all $v \lt u$ where $u\in U$. Then define $f(u)=\min\{ w\in W:f(v) \lt w \text{ for all }v \lt pred_U(u)\}$.
This proof is very long because one also has to show that $f$ is really an order isomorphism and that $f(U)$ is an initial segment of $W$ or the whole $W$. Both by transfinite induction... In the proof above, one has to also check that $f(v)$ is not the greatest element of $W$ for $v \lt u\in U$.
On the other hand, I also believe that such a simple and basic statement should have much shorter proof without transfinite recursion&induction.
Do you have any idea for a simpler proof?