Def NDA(C) q == I(NDA) = 1of(hd(C)) St & (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])))) Alph*) & 1of(hd(rev(C))) = q St & 2of(hd(rev(C))) = nil Alph*

Thm* Alph,St:Type, NDA:NDA(Alph;St), C:NComp(Alph;St), q:St. NDA(C) q Prop

Def rev(as) == Case of as; nil nil ; a.as' rev(as') @ [a] (recursive)

Thm* T:Type, as:T*. rev(as) T*

Thm* A:Type, l:A*, n:. 0n n < ||l|| l[n] A

Def hd(l) == Case of l; nil "?" ; h.t h

Thm* A:Type, l:A*. ||l||1 hd(l) A

Thm* Alph,States:Type, n:NDA(Alph;States). I(n) States

Thm* A:Type, B:(AType), p:a:AB(a). 2of(p) B(1of(p))

Def n == 1of(n)

Thm* Alph,States:Type, n:NDA(Alph;States). n StatesAlphStatesProp

Thm* A:Type, B:(AType), p:a:AB(a). 1of(p) A

Def nth_tl(n;as) == if n0 as else nth_tl(n-1;tl(as)) fi (recursive)

Thm* A:Type, as:A*, i:. nth_tl(i;as) A*

Def tl(l) == Case of l; nil nil ; h.t t

Thm* A:Type, l:A*. tl(l) A*

Def ||as|| == Case of as; nil 0 ; a.as' ||as'||+1 (recursive)

Thm* A:Type, l:A*. ||l||

Thm* ||nil||

Def {i..j} == {k:| i k < j }

Thm* m,n:. {m..n} Type

Def as @ bs == Case of as; nil bs ; a.as' a.(as' @ bs) (recursive)

Thm* T:Type, as,bs:T*. (as @ bs) T*

Def ij == j < i

Thm* i,j:. ij

Def AB == B < A

Thm* i,j:. ij Prop

Def i < j == if i < j true ; false fi

Thm* i,j:. i < j

Def b == if b false else true fi

Thm* b:. b

Def A == A False

Thm* A:Prop. (A) Prop