PrintForm Definitions action sets Sections AutomataTheory Doc

At: pump theorem 1

1. Alph: Type
2. S: ActionSet(Alph)
3. N:
4. s: S.car
5. #(S.car)=N
6. A: Alph*
7. N < ||A||

a,b,c:Alph*. 0 < ||b|| & A = ((a @ b) @ c) & (k:. (S:(a @ (bk)) @ cs) = (S:As))

By: Unfold `card` 5

Generated subgoal:

15. S.car ~ N
6. A: Alph*
7. N < ||A||
a,b,c:Alph*. 0 < ||b|| & A = ((a @ b) @ c) & (k:. (S:(a @ (bk)) @ cs) = (S:As))


About:
existslistandless_thannatural_numberequalalluniverse