(17steps 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
mid
1
1
1.
A
: Type
2.
f
:
A
A
A
3.
u
:
A
4. is_ident(
A
;
f
;
u
)
5. is_assoc_sep(
A
;
f
)
6.
a
:
7.
c
:
8.
a
=
c
b
:
,
e
:({
a
..
b
}
A
).
a
c
c
b
(Iter(
f
;
u
)
i
:{
a
..
b
}.
e
(
i
))
=
f
((Iter(
f
;
u
)
i
:{
a
..
c
}.
e
(
i
)),Iter(
f
;
u
)
i
:{
c
..
b
}.
e
(
i
))
By:
Auto THEN Rewrite by
a
=
c
Generated subgoal:
1
9.
b
:
10.
e
: {
a
..
b
}
A
11.
a
c
12.
c
b
(Iter(
f
;
u
)
i
:{
c
..
b
}.
e
(
i
))
=
f
((Iter(
f
;
u
)
i
:{
c
..
c
}.
e
(
i
)),Iter(
f
;
u
)
i
:{
c
..
b
}.
e
(
i
))
2
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(17steps total)
Remark
PrintForm
Definitions
Lemmas
IteratedBinops
Sections
DiscrMathExt
Doc