Definitions
FTA
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Some definitions of interest.
int_seg
Def
{
i
..
j
} == {
k
:
|
i
k
<
j
}
Thm*
m
,
n
:
. {
m
..
n
}
Type
nat
Def
== {
i
:
| 0
i
}
Thm*
Type
trivial_factorization
Def
trivial_factorization(
z
)(
i
) == if
i
=
z
1 else 0 fi
Thm*
a
,
b
:
,
z
:{
a
..
b
}. trivial_factorization(
z
)
{
a
..
b
}
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Definitions
FTA
Sections
DiscrMathExt
Doc