IteratedBinops
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Rank
Theorem
Name
2
Thm*
a
,
b
:
,
e
:({
a
..
b
}
).
Thm*
a
<
b
(
i
:{
a
..
b
}.
e
(
i
)) = (
i
:{
a
..
b
-1
}.
e
(
i
))+
e
(
b
-1)
[sum_via_intseg_split_last]
cites the following:
1
Thm*
f
:(
A
A
A
),
u
:
A
,
a
,
b
:
,
e
:({
a
..
b
}
A
).
Thm*
a
<
b
Thm*
Thm*
(Iter(
f
;
u
)
i
:{
a
..
b
}.
e
(
i
)) =
f
((Iter(
f
;
u
)
i
:{
a
..
b
-1
}.
e
(
i
)),
e
(
b
-1))
[iter_via_intseg_split_last]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
IteratedBinops
Sections
DiscrMathExt
Doc