(3steps total)
PrintForm
Definitions
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
A function has at most one inverse.
At:
inv
funs
2
unique
A
,
B
:Type,
f
:(
A
B
),
g
,
h
:(
B
A
).
InvFuns(
A
;
B
;
f
;
g
)
InvFuns(
A
;
B
;
f
;
h
)
g
=
h
By:
Def of InvFuns(<A>;<B>;<f>;<g>)
Generated subgoal:
1
1.
A
: Type
2.
B
: Type
3.
f
:
A
B
4.
g
:
B
A
5.
h
:
B
A
6.
x
:
A
.
g
(
f
(
x
)) =
x
7.
y
:
B
.
f
(
g
(
y
)) =
y
8.
x
:
A
.
h
(
f
(
x
)) =
x
9.
y
:
B
.
f
(
h
(
y
)) =
y
g
=
h
2
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(3steps total)
PrintForm
Definitions
DiscreteMath
Sections
DiscrMathExt
Doc