[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-at (conclusion)
⊦ n0 < n ∧ m + n ≤ # x → sublist(m, n, x)[n0] = x[m + n0]
System applied rule normalize
And obtained the following new goals
Proof step 2
:
n0 < n, m + n ≤ # x ⊦ sublist(m, n, x)[n0] = x[m + n0]
Rule argument
Additional information