Nuprl - Pf nd_ext_valcom 1 1 2 1 1 1 1 1 1 2 1 1 1 1 2 1 1 1

PrintForm Definitions nfa 1 Sections AutomataTheory Doc

At: nd ext valcom 1 1 2 1 1 1 1 1 1 2 1 1 1 1 2 1 1 1

1. Alph: Type
2. St: Type
3. NDA: NDA(Alph;St)
4. C: (StAlph*)*
5. ||C|| > 0
6. i:(||C||-1). ||2of(C[i])|| > 0
7. q: St
8. a: Alph
9. p: St
10. NDA(C) q
11. NDA(q,a,p)
12. i:
13. 0i
14. i < ||map(c. < 1of(c),a.2of(c) > ;C)||+1-1
15. i < ||C||-1

2of(C[(i+1)]) = rev(tl(rev(2of(C[i]))))

By: Analyze 10

Generated subgoal:

1 10. I(NDA) = 1of(hd(C))
11. (i:(||C||-1). NDA(1of(C[i]),hd(rev(2of(C[i]))),1of(C[(i+1)])) & 2of(C[(i+1)]) = rev(tl(rev(2of(C[i]))))) & 1of(hd(rev(C))) = q & 2of(hd(rev(C))) = nil
12. NDA(q,a,p)
13. i:
14. 0i
15. i < ||map(c. < 1of(c),a.2of(c) > ;C)||+1-1
16. i < ||C||-1
2of(C[(i+1)]) = rev(tl(rev(2of(C[i]))))

About: