Some definitions of interest.
nat	Def  == {i:| 0i }
	Thm*   Type
le	Def AB == B<A
	Thm* i,j:. (ij)  Prop
length	Def ||as|| == Case of as; nil  0 ; a.as'  ||as'||+1  (recursive)
	Thm* A:Type, l:A List. ||l||
	Thm* ||nil||
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
zip	Def zip(as;bs) Def == Case of as Def == Canil  nil Def == Caa.as'  Case of bs; nil  nil ; b.bs'  [<a,b> / zip(as';bs')] Def (recursive)
	Thm* T1,T2:Type, as:T1 List, bs:T2 List. zip(as;bs)  (T1T2) List

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