DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Rank
Theorem
Name
2
Thm*
(
x
:
A
.
B
(
x
)
B'
(
x
))
({
x
:
A
|
B
(
x
) } ~ {
x
:
A
|
B'
(
x
) })
[set_functionality_wrt_one_one_corr_n_pred2]
cites the following:
1
Thm*
Bij(
A
;
A'
;
f
)
Thm*
Thm*
(
x
:
A
.
B
(
x
)
B'
(
f
(
x
)))
({
x
:
A
|
B
(
x
) } ~ {
x
:
A'
|
B'
(
x
) })
[card_settype]
0
Thm*
InvFuns(
A
;
A
;Id;Id)
[inv_funs_2_identity]
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