(12steps total)
PrintForm
Definitions
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Bijections have inverses.
At:
bij
imp
exists
inv
version2
A
,
B
:Type,
f
:(
A
B
). Bij(
A
;
B
;
f
)
(
g
:(
B
A
). InvFuns(
A
;
B
;
f
;
g
))
By:
SideProof
Generated subgoal:
1
1.
A
: Type
2.
B
: Type
3.
f
:
A
B
4. Inj(
A
;
B
;
f
)
5. Surj(
A
;
B
;
f
)
g
:(
B
A
). InvFuns(
A
;
B
;
f
;
g
)
8
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(12steps total)
PrintForm
Definitions
DiscreteMath
Sections
DiscrMathExt
Doc