Def P  Q == PQ

is mentioned by

Thm* P:(). P(0) & (n:. P(n)  P(n+1))  (n:. P(n))	[induction]
Thm* m,n:. m+1 = n+1    m = n	[inv_suc]
Thm* n:, x:'a, f:('a'a). n>0  ncompose(f;n;x) = f(ncompose(f;n-1;x))	[ncompose_pos]

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

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