[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 3 from proof getbar-length-01 (conclusion)
j0 ≤ j1 ⊦ ((* j1)) ≤ j → # getbytearray(r, i, j - ((* j0)), st) = i→n(j - j0)
Special step normalize
And obtained the following new goals
Proof step 2
:
j0 ≤ j1 ⊦ j1 ≤ j → # getbytearray(r, i, j - j0, st) = i→n(j - j0)