[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-putbar
⊦ okbytearray(r1, st) → (cyclic(str, r, putByteArray(bytes, r1, i, st)) ↔ cyclic(str, r, st))
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: 9
Used lemmas:
cyclic-putbyte-01
,
Used spec theorems:
storearrays
/
putBar-rec
okfuns
/
okbar-putbar-same
Used simplifier rules:
list
/bytelist/
e-01
list
/bytelist/
c-08
list
/bytelist/
c-07
list
/bytelist/
app-02-ant
list
/bytelist/
e
list
/bytelist/
a
list
/bytelist/
c
storearrays
/
putBar-empty