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.
Join Matchmaticians Affiliate Marketing
Program to earn up to 50% commission on every question your affiliated users ask or answer.
 answered
 252 views
 $10.00
Related Questions
 Recursive Set
 Proof through inclusion (A∆B) ∪ A = A ∪ B
 InclusionExclusion and Generating Function with Coefficient (and Integer Equation)
 Find a system consisting of two sets, neither of which is a subset of the other
 Souslin operation
 Irrational Number
 Set Theory Question Help
 Set problem. Need it well written...