PrintForm Definitions action sets Sections AutomataTheory Doc

At: pump thm cor 1 1 1 2
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)

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

111. l:Alph*. ||l|| < k & (S:ls) = f
l:Alph*. ||l||n & (S:ls) = f

About:
impliesexistslistandless_than
equaluniverseintnatural_numbersubtract