(12steps total)
PrintForm
Definitions
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
bij
imp
exists
inv
version2
a
1
1.
A
: Type
2.
B
: Type
3.
f
:
A
B
4. Bij(
A
;
B
;
f
)
g
:(
B
A
). InvFuns(
A
;
B
;
f
;
g
)
By:
Compute4 Bij(
A
;
B
;
f
) *
Inj(
A
;
B
;
f
) & Surj(
A
;
B
;
f
) THEN Analyze 4
Generated subgoal:
1
4. Inj(
A
;
B
;
f
)
5. Surj(
A
;
B
;
f
)
g
:(
B
A
). InvFuns(
A
;
B
;
f
;
g
)
PREMISE
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(12steps total)
PrintForm
Definitions
DiscreteMath
Sections
DiscrMathExt
Doc
B
g:(B
Inj(A; B; f) & Surj(A; B; f) THEN Analyze 4
