(12steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
dedekind
inf
imp
inf
1
1
1
1.
A
: Type
2.
a
:
A
3.
f
:
A
A
4. Inj(
A
;
A
;
f
)
5.
(
x
:
A
.
f
(
x
) =
a
)
Inj(
;
A
;
i
.
f
{
i
}(
a
))
By:
n1
,
n2
:
.
f
{
n1
}(
a
) =
f
{
n2
}(
a
)
A
n1
<
n2
Asserted
Generated subgoals:
1
6.
n1
:
7.
n2
:
8.
f
{
n1
}(
a
) =
f
{
n2
}(
a
)
n1
<
n2
6
steps
2
6.
n1
,
n2
:
.
f
{
n1
}(
a
) =
f
{
n2
}(
a
)
n1
<
n2
Inj(
;
A
;
i
.
f
{
i
}(
a
))
2
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(12steps total)
PrintForm
Definitions
Lemmas
DiscreteMath
Sections
DiscrMathExt
Doc