Def x:T. P(x) == (x:T. P(x))

is mentioned by

Thm* 'a:S. (x:'a. false) = false	[bexists_bfalse]
Thm* 'a:S. (x:'a. true) = true	[bexists_btrue]
Def exists == p:'a. x:'a. (p(x))	[hexists]
Def b_exists_unique('a;x.p(x)) Def == (x:'a. p(x))(x,y:'a.  (p(x)p(y))(x = y))	[b_exists_unique]

In prior sections: hol

Try larger context: HOLlib IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html