Definitions graph 1 1 Sections Graphs Doc

Some definitions of interest.
append Def as @ bs == Case of as; nil bs ; a.as' [a / (as' @ bs)] (recursive)
Thm* T:Type, as,bs:T List. (as @ bs) T List
l_member Def (x l) == i:. i < ||l|| & x = l[i] T
Thm* T:Type, x:T, l:T List. (x l) Prop
length Def ||as|| == Case of as; nil 0 ; a.as' ||as'||+1 (recursive)
Thm* A:Type, l:A List. ||l||
Thm* ||nil||
nat Def == {i:| 0i }
Thm* Type
not Def A == A False
Thm* A:Prop. (A) Prop
select Def l[i] == hd(nth_tl(i;l))
Thm* A:Type, l:A List, n:. 0n n < ||l|| l[n] A

About:
listconsnillist_indint
natural_numberaddless_thansetrecursive_def_noticeuniverse
equalmemberpropimpliesfalseallexists
!abstraction

Definitions graph 1 1 Sections Graphs Doc