PrintForm Definitions action sets Sections AutomataTheory Doc

At: n0n1 irregular 1 1 1 1 1 1

1. S: ActionSet()
2. s: S.car
3. q: S.car
4. n:
5. f: S.carn
6. g:(nS.car). InvFuns(S.car; n; f; g)
7. k:. (S:n0n1(k)s) = q
8. i: (n+1)
9. j: (n+1)
10. i < j
11. (i.f((S:([1]i)s)))(i) = (i.f((S:([1]i)s)))(j) n

L:*. (S:Ls) = q & (k:. L = n0n1(k))

By: Reduce 11

Generated subgoal:

111. f((S:([1]i)s)) = f((S:([1]j)s))
L:*. (S:Ls) = q & (k:. L = n0n1(k))


About:
existslistintandequalallfunction
natural_numberaddless_thanapplylambdaconsnil