Definitions FTA Sections DiscrMathExt Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Some definitions of interest.
reduce_factorizationDef  reduce_factorization(f; j)(i) == if i=j f(i)-1 else f(i) fi
Thm*  a,b:, f:({a..b}), j:{a..b}.
Thm*  0<f(j)  reduce_factorization(f; j)  {a..b}
eq_intDef  i=j == if i=j true ; false fi
Thm*  i,j:. (i=j)  
int_segDef  {i..j} == {k:| i  k < j }
Thm*  m,n:. {m..n}  Type
natDef   == {i:| 0i }
Thm*    Type

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

Definitions FTA Sections DiscrMathExt Doc