(2steps total)
Remark
PrintForm
Definitions
Lemmas
IteratedBinops
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
iter
via
intseg
split
last
1
1.
A
: Type
2.
f
:
A
A
A
3.
u
:
A
4.
a
:
5.
b
:
6.
e
: {
a
..
b
}
A
7.
a
<
b
(Iter(
f
;
u
)
i
:{
a
..
b
}.
e
(
i
)) =
f
((Iter(
f
;
u
)
i
:{
a
..
b
-1
}.
e
(
i
)),
e
(
b
-1))
By:
BackThru:
Thm*
f
:(
A
A
A
),
u
:
A
,
a
,
b
:
,
e
:({
a
..
b
}
A
).
Thm*
a
<
b
Thm*
Thm*
(
c
:
.
Thm* (
b
=
c
+1
Thm* (
Thm* (
(Iter(
f
;
u
)
i
:{
a
..
b
}.
e
(
i
)) =
f
((Iter(
f
;
u
)
i
:{
a
..
c
}.
e
(
i
)),
e
(
c
)))
Generated subgoals:
None
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(2steps total)
Remark
PrintForm
Definitions
Lemmas
IteratedBinops
Sections
DiscrMathExt
Doc