PrintForm Definitions list 3 autom Sections AutomataTheory Doc

At: append segment 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1

1. T: Type
2. as: T*
3. i: {0...||as||}
4. j: {i...||as||}
5. k: {j...||as||}
6. x:
7. 0 < x
8. kx+i

hd(nth_tl(-1+i+x;as)).firstn(-i+k+-x;nth_tl(i+x;as)) = firstn(1+-i+k+-x;nth_tl(-1+i+x;as))

By:
Inst Thm* y:, as:T*. tl(nth_tl(y;as)) = nth_tl(y+1;as) [T;i+x-1;as]
THEN
ArithSimp -1


Generated subgoal:

19. tl(nth_tl(-1+i+x;as)) = nth_tl(i+x;as)
hd(nth_tl(-1+i+x;as)).firstn(-i+k+-x;nth_tl(i+x;as)) = firstn(1+-i+k+-x;nth_tl(-1+i+x;as))


About:
equallistconsaddminus
natural_numbersubtractuniverseintless_than