Some definitions of interest.
nat	Def  == {i:| 0i }
	Thm*   Type
rel_exp	Def R^n == if n=0 x,y. x = y  T else x,y. z:T. (x R z) & (z R^n-1 y) fi Def (recursive)
	Thm* n:, T:Type, R:(TTProp). R^n  TTProp

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