[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-part (conclusion)
⊦ # x = n0 + m0 → firstn(m0, x) + firstn(n0, restn(m0, x)) = x
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 2
:
# x = n0 + m0 ⊦ firstn(m0, x) + firstn(n0, restn(m0, x)) = x
Rule argument
Additional information