[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 9 from proof sublist-part (
previous step
)
# x0 = n0 + m, ∀ n0, m0. # x0 = n0 + m0 → firstn(m0, x0) + firstn(n0, restn(m0, x0)) = x0 ⊦ firstn(m, x0) + firstn(n0, restn(m, x0)) = x0
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 2 terms: n0, m
Additional information
Used terms: n0, m