PrintForm Definitions finite sets Sections AutomataTheory Doc

At: phole aux 2 1 1 1 1

1. n: {2...}
2. f:(n(-1+n)). i:n, j:i. f(i) = f(j)
3. f: (1+n)n
4. ii:{1..(1+n)}, jj:ii. f(ii) = f(jj)

(x.if f(x)=n-1 f(n) else f(x) fi) n(-1+n)

By:
Analyze
THEN
SplitOnConclITE


Generated subgoals:

15. x: n
6. f(x) = n-1
f(n) (-1+n)
25. x: n
6. f(x) = n-1
f(x) (-1+n)


About:
memberfunctionnatural_numberaddminuslambda
ifthenelseapplysubtractallexistsequal