(12steps total)
PrintForm
Definitions
Lemmas
FTA
Sections
DiscrMathExt
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
can
reduce
composite
factor
1
1.
k
: {2...}
2.
g
: {2..
k
}
x
,
y
:{2..
k
}.
x
y
<
k
(
h
:({2..
k
}
).
(
{2..
k
}(
g
) =
{2..
k
}(
h
)
(
&
h
(
x
y
) = 0
(
& (
u
:{2..
k
}.
x
y
<
u
h
(
u
) =
g
(
u
)))
By:
{Without loss of generality, assume
x
y
and observe that
y
<
x
y
(hence
x
y
{Without loss of generality, assume
x
y
and observe that
y
<
x
y
(hence
{2..
k
})
{
}
SideProof
Generated subgoal:
1
3.
x
: {2..
k
}
4.
y
: {2..
k
}
5.
x
y
6.
x
y
<
k
7.
y
<
x
y
h
:({2..
k
}
).
{2..
k
}(
g
) =
{2..
k
}(
h
) &
h
(
x
y
) = 0 & (
u
:{2..
k
}.
x
y
<
u
h
(
u
) =
g
(
u
))
6
steps
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
(12steps total)
PrintForm
Definitions
Lemmas
FTA
Sections
DiscrMathExt
Doc