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]
Def one_one('a;'b;f) == x,y:'a. f(x) = f(y)  'b  x = y	[one_one]

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

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