IteratedBinops
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Rank
Theorem
Name
3
Thm*
a
,
b
:
,
e
:({
a
..
b
}
). (
i
:{
a
..
b
}.
e
(
i
) = 1)
(
i
:{
a
..
b
}.
e
(
i
)) = 1
[mul_via_intseg_one]
cites the following:
2
Thm*
f
:(
A
A
A
),
u
:
A
.
Thm*
is_ident(
A
;
f
;
u
)
Thm*
Thm*
(
a
,
b
:
,
e
:({
a
..
b
}
A
).
Thm* (
(
i
:{
a
..
b
}.
e
(
i
) =
u
)
(Iter(
f
;
u
)
i
:{
a
..
b
}.
e
(
i
)) =
u
)
[iter_via_intseg_all_units]
0
Thm*
is_ident(
; (
x
,
y
.
x
y
); 1)
[intmul_ident_one]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
IteratedBinops
Sections
DiscrMathExt
Doc