DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Rank
Theorem
Name
2
Thm*
InvFuns(
A
;
A
;
f
;
g
)
(
i
:
. InvFuns(
A
;
A
;
f
{
i
};
g
{
i
}))
[compose_iter_inverses]
cites the following:
1
Thm*
x
:
A
,
f
:(
A
A
),
i
,
j
,
k
:
.
k
=
i
+
j
f
{
i
}(
f
{
j
}(
x
)) =
f
{
k
}(
x
)
[compose_iter_sum]
0
Thm*
f
:(
A
A
).
f
{
1} =
f
[compose_iter_once]
0
Thm*
InvFuns(
A
;
B
;
f
;
g
)
InvFuns(
B
;
A
;
g
;
f
)
[inv_funs_2_sym]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
DiscreteMath
Sections
DiscrMathExt
Doc