(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.
A
: Type
2.
B
: Type
3.
f
:
A
B
4. Bij(
A
;
B
;
f
)
g
:(
B
A
). InvFuns(
A
;
B
;
f
;
g
)
By:
Repeat (Unfolds [`biject`;`inject`;`surject`] 4) THEN Analyze 4
Generated subgoal:
1
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
)
10
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
B
g:(B
a1,a2:A. f(a1) = f(a2) 
a1 = a2
