(12steps total)
PrintForm
Definitions
Lemmas
fun
1
Sections
StandardLIB
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
bij
imp
exists
inv
1
1
1.
A
: Type
2.
B
: Type
3.
f
:
A
B
4.
a1
,
a2
:
A
.
f
(
a1
) =
f
(
a2
)
a1
=
a2
5.
b
:
B
.
a
:
A
.
f
(
a
) =
b
g
:(
B
A
). InvFuns(
A
;
B
;
f
;
g
)
By:
(FwdThru
(
Thm*
Q
:(
A
B
Prop). (
x
:
A
.
y
:
B
.
Q
(
x
,
y
))
(
f
:(
A
B
).
x
:
A
.
Q
(
x
,
f
(
x
)))
(
[5])
THEN
(Thin 5)
Generated subgoal:
1
5.
f1
:(
B
A
).
b
:
B
.
f
(
f1
(
b
)) =
b
g
:(
B
A
). InvFuns(
A
;
B
;
f
;
g
)
9
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(12steps total)
PrintForm
Definitions
Lemmas
fun
1
Sections
StandardLIB
Doc