[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 addbar-okarray-01
⊦ i = n→i(# ints) ∧ r ≠ jvmref → okarray(refval(r), byte_type, i, addbytearray(r, ints, st))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
addbar-okarray-03
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 12
Used lemmas:
add-at-ok-01
,
in-add
,
length-1init-01
,
length-init
,
okreftype-init-02
,
addbytearray-ints
,
Used spec theorems:
okfuns
/
okarrayOfLength
storearrays
/
is_arrayref
valuesfuns
/
vals-at
intnat
/
num-i2n-le-02
Used simplifier rules:
nat
/
lels
nat
/
lez
javavalue
/
test-36
list-data
/intlista/
l
nat-basic1
/
z
intnat
/
num-n2i-ls-02
int-abs
/
forward-le-01
int-abs
/
forward-le-05
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
lels
int-abs
/
lels-03
okfuns
/
oktype-byte
intnat
/
nat2int
javavalue
/
inj-04
valuesfuns
/
ints2bytes-len
valuesfuns
/
mkjava-len
store
/javastore/
in-pair
javavalue
/
sel-09