Some definitions of interest.
sfa_doc_greater_list_bound	Def y greater-bounds x == i:||x||. x[i]<y
	Thm* x: List, y:. y greater-bounds x  Prop
int_seg	Def {i..j} == {k:| i  k < j }
	Thm* m,n:. {m..n}  Type
nat	Def  == {i:| 0i }
	Thm*   Type
not	Def A == A  False
	Thm* A:Prop. (A)  Prop

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