Def ConFreeG(G) == i:||G.prod||. (a:V. [inl(a)] = 1of(G.prod[i]) (V+T List)) & ||2of(G.prod[i])|| > 0

Thm* V,T:Type, G:Grammar(V;T). ConFreeG(G) Prop

Thm* V,T:Type, g:Grammar(V;T). g.prod ((V+T List)(V+T)*)*

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

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

Def T List == {l:(T*)| ||l|| > 0 }

Thm* T:Type. (T List) Type

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

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

Thm* ||nil||

Thm* i,j:. i > j Prop

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

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

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

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 hd(l) == Case of l; nil "?" ; h.t h

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

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

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

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