[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 8 from proof sublist-lenrec-01 (
previous step
)
n0 ≤ # y0, ∀ y, a. n0 ≤ # y → a ' + firstn(n0, y) = firstn(n0, a ' + y) + (a ' + y)[n0] ' ⊦ a0 ' + firstn(n0, y0) = firstn(n0, a0 ' + y0) + (a0 ' + y0)[n0] '
Heuristic quantifier closing applied rule all left
And closed the goal!
Rule argument
pos: left 2 terms: y0, a0
Additional information
Used terms: y0, a0