Def P & Q == PQ

is mentioned by

Thm* p:('a).  Thm* b_exists_unique('a;x.p(x)) Thm*  Thm* (x:'a. p(x)) & (x,y:'a. p(x) & p(y)  x = y)

[assert_of_b_exists_unique]

In prior sections: core int 1 bool 1 hol fun 1

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