Thms exponent Sections AutomataTheory Doc

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

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

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

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

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

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

Thm* ||nil||

nat Def == {i:| 0i }

Thm* Type

nat_plus Def == {i:| 0 < i }

Thm* Type

lelt Def i j < k == ij & j < k

le Def AB == B < A

Thm* i,j:. ij Prop

not Def A == A False

Thm* A:Prop. (A) Prop

About:
!abstractionimpliesfalseallpropmember
less_thanintandsetnatural_numberuniverse
recursive_def_noticelist_indaddlistnilcons