Some definitions of interest.
exp	Def exp(m;n) == if n=0 then 1 else mexp(m;n-1) fi   (recursive)
	Thm* m,n:. exp(m;n)
gt	Def i>j == j<i
	Thm* i,j:. (i>j)  Prop
nat	Def  == {i:| 0i }
	Thm*   Type
	Thm*   S

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