[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
,
Theorem getbar-restn-04
0 ≤ i ∧ 0 ≤ j ∧ n→i(n) ≤ j ⊦ restn((* n), mkjavavalues(getbytearray(r, i, j, st))) = mkjavavalues(getbytearray(r, n→i(n) + i, j - n→i(n), st))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 7
Used lemmas:
bar-restn
,
bar-len-02
,
Used spec theorems:
valuesfuns
/
mkjavavalues-restn
Used simplifier rules:
int-abs
/
sub-add
int-abs
/
lels-01
int-basic2
/
ls
int-abs
/
lels-04
nat
/
lep
intnat
/
add-nonneg-int-to-nat
nat
/
lels-01
nat-basic2
/
l-02
nat-basic2
/
a
nat-basic2
/
c
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
lep
int-abs
/
forward-le-01
int-abs
/
elim-sub