Some definitions of interest.
le	Def AB == B<A
	Thm* i,j:. (ij)  Prop
reject	Def as\[i] Def == if i0 tl(as) else Case of as; nil  nil ; a'.as'  a'.as'\[i-1] fi Def (recursive)
	Thm* A:Type, l:A List, n:. l\[n]  A List

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