User blog:Alemagno12/Creating an OCF based on any function from ordinals to ordinals

Take any function F from ordinals to ordinals. Then, we define: ≥≤
 * ψ0F(0)[0] = 0
 * ψβ+1F(0) = min{x|"x is regular"∧∀y 0: ψβF(α+1)[0] = ψβF(α)+1
 * α+1 > 0: ψβF(α+1)[n+1] = F(ψβF(α+1)[n])
 * ω ≤ cof(α) < ψβ+1F(0): ψβF(α)[n] = ψβF(α[n])
 * cof(α) = ψβ+1F(0): ψβF(α)[0] = 0
 * cof(α) = ψβ+1F(0): ψβF(α)[n+1] = ψβF(α[ψβF(α)[n]])
 * cof(α) > ψβ+1F(0): ψβF(α) = ψβF(ψβ+1F(α))
 * [WIP]