# Prove a set is well-ordered

Let $FS(?, ?) ? { f | f : ?->? & Fin( {? | ? ? ? & not( f(?) = 0 ) })}$ for all ordinals ?, ?,
where Fin(A) means the set A is finite.

We define a relation ? on FS:  $f ? g ?? (?? < ?)( f(?) < g(?) & (?? < ?)( ? < ? ? f(?) = g(?)))$.

How to prove that (FS, ?) is well-ordered?

Answers can be viewed only if
1. The questioner was satisfied and accepted the answer, or
2. The answer was disputed, but the judge evaluated it as 100% correct.