Some definitions of interest.
bif	Def bif(b; bx.x(bx); by.y(by)) == if b x(*) else y(x.x) fi
	Thm* A:Type, b:, x:(bA), y:((b)A). bif(b; bx.x(bx); by.y(by))  A
eq_int	Def i=j == if i=j true ; false fi
	Thm* i,j:. (i=j)
nat	Def  == {i:| 0i }
	Thm*   Type
	Thm*   S

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