Some definitions of interest.
assert	Def b == if b True else False fi
	Thm* b:. b  Prop
decidable	Def Dec(P) == P  P
	Thm* A:Prop. Dec(A)  Prop
iff	Def P  Q == (P  Q) & (P  Q)
	Thm* A,B:Prop. (A  B)  Prop
l_member	Def (x  l) == i:. i<||l|| & x = l[i]  T
	Thm* T:Type, x:T, l:T List. (x  l)  Prop

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