[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 cyclic-putbyte-01
⊦ okbytearray(r1, st) → (cyclic(str, r, st[r1 -- i ', byteval(by)]) ↔ cyclic(str, r, st))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
cyclic-putbar
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
validrefs-putbyte
,
cyclic-def-shortest
,
cyclic-def-simple
,
cyclic-putbyte
,
Used spec theorems:
Used simplifier rules:
list-dup
/references/
f
list
/references/
c-08
list-dup
/references/
dups-cons
list
/references/
in-17
list
/references/
in-append
list
/references/
a
list
/references/
e-01
list
/references/
c
list
/references/
in-empty
list-data
/references/
elim-list-c
javastore
/
type-at