Def P  Q == P+Q

is mentioned by

Thm* R:(TTProp).  Thm* Order(T;x,y.R(x,y)) Thm*  Thm* (x,y:T. Dec(x = y)) Thm*  Thm* (a,b:T. R(a,b)  strict_part(x,y.R(x,y);a;b)  a = b)	[order_split]
Thm* R:(TTProp).  Thm* (a,b:T. Dec(R(a,b))) Thm*  Thm* (Connex(T;x,y.R(x,y)) Thm* ( Thm* ((a,b:T. Thm* ((strict_part(x,y.R(x,y);a;b) Thm* (( Symmetrize(x,y.R(x,y);a;b) Thm* (( strict_part(x,y.R(x,y);b;a)))	[connex_iff_trichot]
Def Connex(T;x,y.R(x;y)) == x,y:T. R(x;y)  R(y;x)	[connex]

In prior sections: core bool 1

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