PrintForm Definitions finite sets Sections AutomataTheory Doc

At: phole aux 2 1 1

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

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

By: Analyze 0

Generated subgoal:

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


About:
impliesallnatural_numberaddequal
applyexistsfunctionminus