(27steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
inv
pair
inv
1
1
1.
A
: Type
2.
B
: Type
(
fg
.
fg
/
f
,
g
. <
f
,
g
,(
x
.
*
),(
y
.
*
)>)
(
A
B
)
(
A
~
B
)
By:
Analyze THEN Analyze3 THEN New:[
f
|
g
] Analyze3
THEN
Reduce Hyp:-1 THEN Reduce Concl
Generated subgoal:
1
3.
f
:
A
B
4.
g
:
B
A
5. InvFuns(
A
;
B
;
f
;
g
)
<
f
,
g
,(
x
.
*
),(
y
.
*
)>
(
A
~
B
)
2
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(27steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc