Definitions DiscreteMath Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Some definitions of interest.
iffDef  P  Q == (P  Q) & (P  Q)
Thm*  A,B:Prop. (A  B Prop
is_list_memDef  a  xs == Case of xs; nil  False ; x.ys  a = x  A  (a  ys)
Def  (recursive)
Thm*  A:Type, a:Axs:A List. (a  xs Prop

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

Definitions DiscreteMath Sections DiscrMathExt Doc