(13steps total)
PrintForm
Definitions
IteratedBinops
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
iter
via
intseg
wf
1
1.
A
: Type
2.
f
:
A
A
A
3.
u
:
A
4.
a
:
b
:
,
e
:({
a
..
b
}
A
). (Iter(
f
;
u
)
i
:{
a
..
b
}.
e
(
i
))
A
By:
n
:
,
b
:
.
b
n
+
a
(
e
:({
a
..
b
}
A
). (Iter(
f
;
u
)
i
:{
a
..
b
}.
e
(
i
))
A
) Asserted
Generated subgoals:
1
n
:
,
b
:
.
b
n
+
a
(
e
:({
a
..
b
}
A
). (Iter(
f
;
u
)
i
:{
a
..
b
}.
e
(
i
))
A
)
5
steps
2
5.
n
:
,
b
:
.
b
n
+
a
(
e
:({
a
..
b
}
A
). (Iter(
f
;
u
)
i
:{
a
..
b
}.
e
(
i
))
A
)
b
:
,
e
:({
a
..
b
}
A
). (Iter(
f
;
u
)
i
:{
a
..
b
}.
e
(
i
))
A
6
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(13steps total)
PrintForm
Definitions
IteratedBinops
Sections
DiscrMathExt
Doc