Definitions hol prim rec Sections HOLlib Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Some definitions of interest.
hallDef all == p:'ax:'a. (p(x))
Thm* 'a:S. all  (('a  hbool)  hbool)
assertDef b == if b True else False fi
Thm* b:b  Prop
hequalDef equal == x:'ay:'ax = y
Thm* 'a:S. equal  ('a  'a  hbool)
himpliesDef implies == p:q:pq
Thm* implies  (hbool  hbool  hbool)
hltDef lt == m:n:m<n
Thm* lt  (hnum  hnum  hbool)
hnumDef hnum == 
Thm* hnum  S
hsucDef suc == n:n+1
Thm* suc  (hnum  hnum)
tlambdaDef (x:Tb(x))(x) == b(x)

About:
boolifthenelseassertnatural_numberaddapply
functionmemberpropfalsetrueall
!abstraction
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

Definitions hol prim rec Sections HOLlib Doc