[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-lastrec
⊦ putByteArray(bytes + by ', r, i, st) = putByteArray(bytes, r, i, st[r -- (i + n→i(# bytes)) ', byteval(by)])
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: 9
Proof steps: 17
Used lemmas:
putBar-rec
,
putBar-empty
,
putBar-one
,
putBar-rew
,
Used spec theorems:
store
/javastore/
rew
Used simplifier rules:
int-abs
/
succ-02
refkey
/
inj-01
refkey
/
inj
storekey
/
inj-04
int-basic2
/
eq
intnat
/
nat2int-07
list
/bytelist/
e-01
list
/bytelist/
c-08
list
/bytelist/
c-07
list
/bytelist/
app-02-ant
list
/bytelist/
e
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
list
/bytelist/
len-02
list
/bytelist/
len
list
/bytelist/
c
int-basic2
/
ax-04
list-data
/bytelist/
size-01
list
/bytelist/
a
list
/bytelist/
Nil
int-abs
/
ler
int-basic2
/
ls
intnat
/
nat2int-08
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
le-add
int-abs
/
lels-01
oelem
/intlista/
irreflexivity