(4steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Mutually inverse functions are surjections.
At:
invfuns
are
surj
A
,
B
:Type,
f
:(
A
B
),
g
:(
B
A
).
InvFuns(
A
;
B
;
f
;
g
)
Surj(
A
;
B
;
f
) & Surj(
B
;
A
;
g
)
By:
Auto
Generated subgoal:
1
1.
A
: Type
2.
B
: Type
3.
f
:
A
B
4.
g
:
B
A
5. InvFuns(
A
;
B
;
f
;
g
)
Surj(
A
;
B
;
f
) & Surj(
B
;
A
;
g
)
3
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(4steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc