DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Rank
Theorem
Name
2
Thm*
R
:(
A
B
Prop).
Thm*
(1-1-Corr
x
:
A
,
y
:
B
.
R
(
x
;
y
))
Thm*
Thm*
(
f
:(
A
B
),
g
:(
B
A
).
Thm* (
InvFuns(
A
;
B
;
f
;
g
) & (
x
:
A
,
y
:
B
.
R
(
x
;
y
)
y
=
f
(
x
) &
x
=
g
(
y
)))
[one_one_corr_rel_vs_invfuns]
cites the following:
1
Thm*
(
x
:
A
.
!
y
:
B
(
x
).
P
(
x
;
y
))
(
f
:(
x
:
A
B
(
x
)).
x
:
A
.
P
(
x
;
f
(
x
)))
[fun_description]
0
Thm*
P
:(
A
Prop). (
!
u
:
A
.
P
(
u
))
(
y
,
z
:
A
.
P
(
y
)
P
(
z
)
y
=
z
)
[exists_unique_elim]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
DiscreteMath
Sections
DiscrMathExt
Doc