Some definitions of interest.
label	Def t  ...$L == t
map2	Def map2(f;l1;l2) Def == if null(l1) Def == then nil Def == else if null(l2) Def == else then nil Def == else else cons((f(head(l1),head(l2))); map2(f;tl(l1);tl(l2))) Def == else fi  Def == fi  Def (recursive)
	Thm* 'a,'b,'c:Type, f:('a'b'c), l1:'a List, l2:'b List. Thm* map2(f;l1;l2)  'c List

About: IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html