Nuprl - Pf phole_aux 2 1 2 1

PrintForm Definitions finite sets Sections AutomataTheory Doc

1. n: {2...}
2. f:(n(-1+n)). i:n, j:i. f(i) = f(j)
3. f: (1+n)n
4. 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)

By: Let (fi = f(iii)) THEN Decide (x:iii. fi = f(x))

Generated subgoals:

1 7. fi: n
8. fi = f(iii)
9. x:iii. fi = f(x)
i:(1+iii), j:i. f(i) = f(j)

2 7. fi: n
8. fi = f(iii)
9. (x:iii. fi = f(x))
i:(1+iii), j:i. f(i) = f(j)

About:

1	7. `fi:` `n` 8. `fi = f(iii)` 9. `x:iii. fi = f(x)` `i:(1+iii), j:i. f(i) = f(j)`
2	7. `fi:` `n` 8. `fi = f(iii)` 9. `(x:iii. fi = f(x))` `i:(1+iii), j:i. f(i) = f(j)`