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
;
B
;
f
;
g
)
Bij(
B
;
A
;
g
)
[fun_with_inv2_is_bij_rev]
cites the following:
0
Thm*
InvFuns(
A
;
B
;
f
;
g
)
InvFuns(
B
;
A
;
g
;
f
)
[inv_funs_2_sym]
1
Thm*
InvFuns(
A
;
B
;
f
;
g
)
Bij(
A
;
B
;
f
)
[fun_with_inv2_is_bij]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
DiscreteMath
Sections
DiscrMathExt
Doc
Bij(B; A; g) InvFuns(B;A;g;f) Bij(A; B; f) Bij(B; A; g) InvFuns(B;A;g;f) Bij(A; B; f)