[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Proof step 1 from proof sublist-num (conclusion)
⊦ sublist((* m), (* n), x) = firstn(n, restn(m, x))
Special step normalize
And obtained the following new goals
Proof step 2
:
⊦ sublist(m, n, x) = firstn(n, restn(m, x))