Who Cites bexists?
bexists	Def x:T. P(x) == (x:T. P(x))
	Thm* T:Type, P:(T). (x:T. P(x))
assert	Def b == if b True else False fi
	Thm* b:. b  Prop
prop_to_bool	Def P == InjCase(lem(P) ; true; false)
	Thm* P:Prop. (P)

Syntax:

x:T. P(x)

has structure:

bexists(T; x.P(x))

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