(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
a
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:
x
,
y
:{2..
k
}.
x
y
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
)))
Asserted ...
THEN
Inst:
Thm*
i
:{2...},
j
:{1...}.
j
<
i
j
Using:[
x
|
y
] ...w
Generated subgoals:
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
))
PREMISE
2
3.
x
,
y
:{2..
k
}.
3.
x
y
3.
3.
x
y
<
k
3.
3.
(
h
:({2..
k
}
).
3. (
{2..
k
}(
g
) =
{2..
k
}(
h
)
3. (
&
h
(
x
y
) = 0
3. (
& (
u
:{2..
k
}.
x
y
<
u
h
(
u
) =
g
(
u
)))
4.
x
: {2..
k
}
5.
y
: {2..
k
}
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
))
2
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