PrintForm Definitions action sets Sections AutomataTheory Doc

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

l:Alph*. ||l||n & (S:ls) = f
By: Assert (k:. (l:Alph*. ||l|| < k & (S:ls) = f) (l:Alph*. ||l||n & (S:ls) = f))
Generated subgoals:

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

About:
existslistandequalallimpliesless_thanuniverse