Some definitions of interest.
assert	Def b == if b True else False fi
	Thm* b:. b  Prop
gt	Def i>j == j<i
	Thm* i,j:. (i>j)  Prop
nat	Def  == {i:| 0i }
	Thm*   Type
	Thm*   S
le	Def AB == B<A
	Thm* i,j:. (ij)  Prop
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