Some definitions of interest.
deq	Def EqDecider(T) == eq:TTx,y:T. x = y  (eq(x,y))
	Thm* T:Type. EqDecider(T)  Type
assert	Def b == if b True else False fi
	Thm* b:. b  Prop
fpf-dom	Def x  dom(f) == deq-member(eq;x;1of(f))
fpf-single	Def x : v == <[x],x.v>
iff	Def P  Q == (P  Q) & (P  Q)
	Thm* A,B:Prop. (A  B)  Prop
top	Def Top == Void given Void
	Thm* Top  Type

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