[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 getbytearray-addarray-this
⊦ 0 ≤ i → getbytearray(r, addarray(r, byte_type, i, st)) = mklist(i2b(0), i→n(i))
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: 7
Proof steps: 14
Used lemmas:
at-1dim
,
length-1dim
,
Used spec theorems:
list-del
/bytelist/
extension
storearrays
/
getbar-len-03
storearrays
/
bar-at-01
intnat
/
num-i2n-ls-02
valuefuns
/
init_val_byte
byte
/
zero-byte
Used simplifier rules:
javavalue
/
sel-08
intnat
/
nat2int
int-basic1
/
ls-01
int-abs
/
lels-03
nat-basic1
/
z
intnat
/
num-n2i-ls-02
int-abs
/
forward-le
int-abs
/
lels
int-abs
/
forward-le-05
int-abs
/
lels-02
intnat
/
abs-zero
nat-basic1
/
f
list-del
/bytelist/
get-mklist-01
intnat
/
abs-eq
int-abs
/
zero-gels-04
javavalue
/
sel-04
int-abs
/
lels-01
int-abs
/
lels-04
list-last
/bytelist/
mk-len
int-abs
/
forward-le-01