Definitions NuprlPrimitives Sections NuprlLIB Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Some definitions of interest.
le_intDef ij == j<i
Thm* i,j:. (ij 
bnotDef b == if b false else true fi
Thm* b:b  
eq_intDef i=j == if i=j true ; false fi
Thm* i,j:. (i=j 
int_isegDef {i...j} == {k:ik & kj }
Thm* i,j:. {i...j Type
int_nzeroDef  == {i:i  0 }
Thm*   Type
int_segDef {i..j} == {k:i  k < j }
Thm* m,n:. {m..n Type
leltDef i  j < k == ij & j<k
natDef  == {i:| 0i }
Thm*   Type
leDef AB == B<A
Thm* i,j:. (ij Prop
lt_intDef i<j == if i<j true ; false fi
Thm* i,j:. (i<j 
nat_plusDef  == {i:| 0<i }
Thm*   Type
nequalDef a  b  T == a = b  T
Thm* A:Type, x,y:A. (x  y Prop

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

Definitions NuprlPrimitives Sections NuprlLIB Doc