[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 add-putbar-rew
⊦ r ≠ r0 → putByteArray(bytes, r, i, addobj(r0, class, fis, st)) = addobj(r0, class, fis, putByteArray(bytes, r, i, 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: 13
Proof steps: 27
Used lemmas:
add-ref
,
add-type
,
add-notin
,
add-in-09
,
add-in-08
,
add-in-04
,
Used spec theorems:
store
/javastore/
Extension
storearrays
/
putBar-in
storekey
/
ex-03
storearrays
/
putbar-atref-01
storearrays
/
putbar-atother-01
Used simplifier rules:
specialkeys
/
type-03
storearrays
/
putbar-inref
storearrays
/
putbar-atref-01
int-basic2
/
add-a
storearrays
/
putbar-byte
javavalue
/
inj-07
int-abs
/
lels-03
int-basic2
/
add-c
int-abs
/
lels-04
int-abs
/
lels
int-abs
/
lels-01
storekey
/
sel-06
refkey
/
sel-02
refkey
/
sel-01
storearrays
/
putBar-in
storekey
/
test-08
javavalue
/
inj-09
storearrays
/
putbar-infs
storearrays
/
putbar-atfs-01
storekey
/
test-07
storearrays
/
putBar-at-fskey
storekey
/
test
storekey
/
elim-04
refkey
/
elim