[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-addbar-02
⊦ 0 ≤ i ∧ 0 ≤ j ∧ i→n(i) + i→n(j) < # ints → getbytearray(r, i, j, addbytearray(r, ints, st)) = is2bs(sublist(i→n(i), i→n(j), ints))
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: 13
Proof steps: 24
Used lemmas:
get-add-02
,
addbytearray-ints
,
Used spec theorems:
storearrays
/
getByteArray
intnat
/
num-n2i-ls
intnat
/
add-01
list-del
/bytelist/
extension
list-del
/javavalues/
sublist-length
list-del
/javavalues/
sublist-at
valuesfuns
/
ints2bytes-at
list-del
/intlista/
sublist-length
list-del
/intlista/
sublist-at
valuesfuns
/
vals-at
Used simplifier rules:
valuesfuns
/
ints2bytes-at
javavalue
/
sel-08
nat
/
lez
nat
/
fle
nat-basic2
/
l
nat-basic2
/
a
nat
/
le-ls-simp
nat
/
fle-01
nat
/
lels
nat
/
ls-le-simp
int-abs
/
forward-le-05
nat
/
lels-03
nat
/
lels-01
valuesfuns
/
bytevals-at
valuesfuns
/
bytevalues-len
nat-basic2
/
c
nat-basic1
/
ls-02
int-abs
/
lels-02
nat-basic2
/
succ
intnat
/
abs-zero
nat-basic1
/
trans-1
nat-basic1
/
trans
int-abs
/
zero-gs
int-basic2
/
add-a
int-basic2
/
add-c
intnat
/
pos-int
valuesfuns
/
ints2bytes-len
valuesfuns
/
mkjava-len
int-abs
/
lels-04
int-abs
/
lels-01
list-data
/intlista/
l
int-abs
/
forward-le-01
nat-basic1
/
f