PrintForm Definitions finite sets Sections AutomataTheory Doc

At: phole aux 2 1 2

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

iii:{1..(1+n)}. ((ii:{iii..(1+n)}, jj:ii. f(ii) = f(jj)) (i:iii, j:i. f(i) = f(j))) (ii:{(1+iii)..(1+n)}, jj:ii. f(ii) = f(jj)) (i:(1+iii), j:i. f(i) = f(j))

By: RepD

Generated subgoal:

14. iii: {1..(1+n)}
5. (ii:{iii..(1+n)}, jj:ii. f(ii) = f(jj)) (i:iii, j:i. f(i) = f(j))
6. ii:{(1+iii)..(1+n)}, jj:ii. f(ii) = f(jj)
i:(1+iii), j:i. f(i) = f(j)


About:
allnatural_numberaddimpliesequal
applyexistsfunctionminus