[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-getbar-le
⊦ j ≤ n→i(# bytes) ∧ 0 ≤ j → getbytearray(r, i, j, putByteArray(bytes, r, i, st)) = firstn(i→n(j), bytes)
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: 16
Used lemmas:
getbar-put-lower
,
getbar-rec
,
putBar-rec
,
bar-empty-01
,
putBar-empty
,
Used spec theorems:
list-del
/bytelist/
firstN-rec-01
Used simplifier rules:
int-abs
/
lels-04
int-abs
/
ler
int-abs
/
succ-02
oelem
/intlista/
irreflexivity
int-abs
/
le-add
int-abs
/
numadd-01
nat-basic2
/
eq-01
intnat
/
rax
int-abs
/
elim-sub
list
/bytelist/
app-01
javavalue
/
sel-08
javastore
/
lookup-if
nat
/
elim-pred-c
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
forward-le-05
int-abs
/
forward-lsle
int-abs
/
lels-02
nat
/
pred-03
intnat
/
abs-zero
list
/bytelist/
e-01
list
/bytelist/
c-08
list
/bytelist/
c-07
list
/bytelist/
app-02-ant
list
/bytelist/
e
int-basic2
/
add-c
int-basic2
/
add-a
intnat
/
num-n2i-ls-07
int-abs
/
numle-02
int-abs
/
lels-01
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
list
/bytelist/
a
list
/bytelist/
len-02
list
/bytelist/
len
list
/bytelist/
c
list-data
/bytelist/
size-01
int-abs
/
anti
list-del
/bytelist/
firstN-zero
intnat
/
nat2int
int-abs
/
forward-le-01
int-abs
/
forward-lele