Def P & Q == PQ

is mentioned by

Thm* P:(). P(0) & (n:. P(n)  P(n+1))  (n:. P(n))	[induction]
Def suc_rep == x:. (@f:. (one_one(;;f) & onto(;;f)))(x)	[hsuc_rep]

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