Some definitions of interest.
every	Def every(p;l) == if null(l) then true else (p(head(l)))every(p;tl(l)) fi  Def (recursive)
	Thm* 'a:Type, p:('a), l:'a List. every(p;l)
stype	Def S == {T:Type| x:T. True }
	Thm* S  Type{2}

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