[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 okbytearray-put-byteval
⊦ okbytearray(r, st) ∧ ¬ r0 -- _length ∈ rkvs → (okbytearray(r, st[((r0 -- i ') × byteval(by)) ' + rkvs]) ↔ okbytearray(r, st[rkvs]))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 12
Used lemmas:
oktype-byte
,
okreftype
,
okarrayNotNull
,
okarray-05
,
okbytearray-01
,
okbar-byteval
,
okbytearray-put-byteval-equiv
,
okbar-put
,
okbytearray-put-byteval-01
,
Used spec theorems:
storefuns
/
put-rkvs-switch-01
Used simplifier rules:
store
/javastore/
notmemlookup
storefunsx
/
lookup-xtra
javavalue
/
test-45
storefuns
/
instore-01
typefuns
/
bytearray
javavalue
/
sel-09
javavalue
/
test-19
int-abs
/
forward-le-01
int-abs
/
forward-lels
storefuns
/
in-put-rkvs
int-abs
/
lels-03
int-abs
/
lels-04
int-abs
/
lels-01
int-abs
/
lels
storefuns
/
lookup-put-rkvs-notin
refkey
/
sel-01
storefuns
/
put-rkvs-absorb-01
list
/refkeyvalues-assoclista/
a