[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 2 from proof mk-tail-01 (
previous step
)
⊦ (mklist(a, m) + x).tail = mklist(a, m -1) + x, m = 0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 3
:
⊦ (mklist(a, m) + x).tail = mklist(a, m - 1) + x, m = 0
Rule argument
Additional information
Used simplifier rules: ⊦ n -1 = n - 1; (s)