At: reach lemma 1 2 1 1
1. Alph: Type
2. S: ActionSet(Alph)
3. si: S.car
4. nn: 
5. f: nn
Alph
6. g: Alphnn
7. Fin(S.car)
8. InvFuns(nn; Alph; f; g)
9. n: 
10. 0 < n
11. RL: S.car*
12. 0 < ||RL||
13. ||RL||
n-1+1
14. RL[(||RL||-1)] = si
15. 
s:S.car. (
w:Alph*. (S:w
si) = s) 
mem_f(S.car;s;RL)
16. y: {x:(S.car*)| 0 < ||x|| & ||x||n+1 }
0||y||-1
By: Analyze -1
Generated subgoals:None
About:
