PrintForm Definitions action sets Sections AutomataTheory Doc

At: pump thm cor 1 1 1 2 1 1 1 1 2 1 1 1
1. n:
2. Alph: Type
3. S: ActionSet(Alph)
4. s: S.car
5. f: S.car
6. #(S.car)=n
7. l:Alph*. (S:ls) = f
8. k:
9. 0 < k
10. (l:Alph*. ||l|| < k-1 & (S:ls) = f) (l:Alph*. ||l||n & (S:ls) = f)
11. l: Alph*
12. ||l|| < k
13. (S:ls) = f
14. ||l||n
15. a: Alph*
16. b: Alph*
17. c: Alph*
18. 0 < ||b|| & l = ((a @ b) @ c)
19. k:. (S:(a @ (bk)) @ cs) = (S:ls)

l:Alph*. ||l||n & (S:ls) = f
By: Witness19 0
Generated subgoal:

119. (S:(a @ (b0)) @ cs) = (S:ls)
l:Alph*. ||l||n & (S:ls) = f

About:
existslistandequalnatural_numberuniverse
intless_thanimpliessubtractall