Prove a set is wellordered
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 wellordered?
Answer
Answers can be viewed only if
 The questioner was satisfied and accepted the answer, or
 The answer was disputed, but the judge evaluated it as 100% correct.

On the second step of the induction you mean FS(L, B) = FS(L, Г) x L are isomorphic right?

Yes, exactly.
The answer is accepted.
 answered
 142 views
 $10.00
Related Questions
 InclusionExclusion and Generating Function with Coefficient (and Integer Equation)
 Set problem. Need it well written...
 Irrational Number
 Find a system consisting of two sets, neither of which is a subset of the other
 Recursive Set
 Set theory question
 Number of Combinations Created from Restricting a Set
 Discrete Math/ Set theory Question