Some definitions of interest.
nat	Def   == {i:| 0i }
	Thm*    Type
le	Def  AB == B<A
	Thm*  i,j:. (ij)  Prop
le_int	Def  ij == j<i
	Thm*  i,j:. (ij)
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