[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 2 from proof bar-firstn (
previous step
)
⊦ n→i(m) + n→i(n) ≤ j → sublist(m, n, getbytearray(r, i, j, st)) = getbytearray(r, i + n→i(m), n→i(n), st)
Lemma
bar-sublist