Def x:A. B(x) == x:AB(x)

is mentioned by

Thm* Q:(Prop given P). Dec(P)  (P  Dec(Q))  Dec(P & Q)	[decidable__cand]
Thm* x:T, l:T List, i:||l||. [x / l][(i+1)] ~ l[i]	[select_cons_tl_sq]
Thm* (a1  a2)  (b1  b2)  (a1 & b1  a2 & b2)	[cand_functionality_wrt_iff]
Def increasing(f;k) == i:(k-1). f(i)<f(i+1)	[increasing]

In prior sections: core fun 1 well fnd int 1 bool 1 int 2 list 1 sqequal 1

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