[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 putBar-in
⊦ rk ∈ putByteArray(bytes, r, i, st) ↔ rk ∈ st ∨ rk .ref = r ∧ is_indexkey(rk .key) ∧ i ≤ rk .key .index ∧ rk .key .index < i + n→i(# bytes)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
putBar-rew
,
putbytearray-in
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
putArray-in
,
putByteArray
,
Used spec theorems:
Used simplifier rules:
refkey
/
sel-01
refkey
/
sel-02
valuesfuns
/
mkjava-len
storekey
/
test-02
int-abs
/
lels-04
int-basic2
/
add-c
int-abs
/
lels-03
storekey
/
test-01
int-abs
/
lels
int-abs
/
lels-01
storekey
/
test
refkey
/
elim