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
iff Def P Q == (P Q) & (P Q)
Thm* A,B:Prop. (A B) Prop
mapoutl Def mapoutl(s) == mapfilter(x.outl(x);x.isl(x);s)
Thm* A,B:Type, s:(A+B) List. mapoutl(s) A List

About:
listconslist_indunionlambda
recursive_def_noticeuniversememberpropimpliesandall!abstraction

Definitions graph 1 1 Sections Graphs Doc