[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 mklist-split-intro (conclusion)
⊦ n ≤ m → mklist(a, m) = mklist(a, m - n) + mklist(a, n)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
n ≤ m ⊦ mklist(a, m) = mklist(a, m - n) + mklist(a, n)
Rule argument
Additional information