[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 5 from proof blastN-mklist (
previous step
)
n0 ≠ 0, ∀ x, a. butlastn(n0, x + mklist(a, n0)) = x ⊦ butlastn(n0, x + a ' + mklist(a, n0 - 1)) = x
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 6
:
∀ x, a. butlastn(n0, x + mklist(a, n0)) = x ⊦ butlastn(n0, x + a ' + mklist(a, n0 - 1)) = x, n0 = 0
Rule argument
Additional information