(3steps total)
PrintForm
Definitions
Lemmas
bool
1
Sections
StandardLIB
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
neg
assert
of
eq
int
1
1.
x
:
2.
y
:
x
=
y
x
y
By:
RWH (LemmaC
Thm*
x
,
y
:
.
x
=
y
x
=
y
) 0
Generated subgoal:
1
x
=
y
x
y
1
step
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(3steps total)
PrintForm
Definitions
Lemmas
bool
1
Sections
StandardLIB
Doc