Def P & Q == PQ

is mentioned by

Def res_choose('a;x.P(x);x.Q(x)) == @x:'a. (P(x) & Q(x))	[res_choose]
Def res_exists('a;x.P(x);x.Q(x)) == x:'a. P(x) & Q(x)	[res_exists]

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

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