PrintForm Definitions finite sets Sections AutomataTheory Doc

At: auto2 list ind 1

1. Alph: Type
2. P: Alph*Prop
3. n:. (l:Alph*. ||l|| < n P(l)) (l:Alph*. ||l|| = n P(l))
4. l: Alph*

P(l)

By: Assert (n:, l:Alph*. ||l|| < n P(l))

Generated subgoals:

1 n:, l:Alph*. ||l|| < n P(l)
25. n:, l:Alph*. ||l|| < n P(l)
P(l)


About:
applyalllistimpliesless_than
universefunctionpropequalint