Def P  Q == (P  Q) & (P  Q)

is mentioned by

Thm* p:. false = p  p	[equal_bfalse_to_assert_2]
Thm* p:. p = false  p	[equal_bfalse_to_assert]
Thm* p:. true = p  p	[equal_btrue_to_assert_2]
Thm* p:. p = true  p	[equal_btrue_to_assert]
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 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