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

is mentioned by

Thm* 'a:S, e:'a. Thm* (fn:(Unit'a). fn() = e) Thm* & (fn,y:(Unit'a). fn() = e & y() = e  fn = y)	[one_axiom_2]
Thm* v:Unit. v =	[one_wd]
Thm* 'a:S, f,g:('aUnit). f = g	[one_axiom]
Thm* 'a:S. all(e:'a. exists_unique(fn:hone  'a. equal(fn(one_el),e)))	[hone_axiom_2]
Thm* 'a:S. all(f:'a  hone. all(g:'a  hone. equal(f,g)))	[hone_axiom]

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

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