(4steps total)
PrintForm
Definitions
Lemmas
LogicSupplement
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
diagonalization
wrt
eq
B
:Type,
e
:(
B
B
).
(
b
:
B
.
e
(
b
) =
b
)
(
A
:Type,
f
:(
A
A
B
).
(
a
:
A
. (Diag
f
wrt
x
.
e
(
x
)) =
f
(
a
)))
By:
Thm*
R
:(
B
B
Prop),
e
:(
B
B
).
Thm*
(
b
:
B
.
R
(
e
(
b
),
b
))
Thm*
Thm*
(
A
:Type,
f
:(
A
A
B
).
(
a
:
A
.
R
((Diag
f
wrt
x
.
e
(
x
))(
a
),
f
(
a
,
a
)))) ;
Auto
Generated subgoal:
1
1.
B
: Type
2.
e
:
B
B
3.
b
:
B
.
e
(
b
) =
b
4.
A
: Type
5.
f
:
A
A
B
(
a
:
A
. (Diag
f
wrt
x
.
e
(
x
)) =
f
(
a
))
3
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(4steps total)
PrintForm
Definitions
Lemmas
LogicSupplement
Sections
DiscrMathExt
Doc