[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 okarray-init-07
⊦ newref(r, st) → (okarray(refval(r), byte_type, i, addarray(r, byte_type, vals, st)) ↔ n→i(# vals) = i ∧ is_bytelist(vals))
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: 10
Proof steps: 19
Used lemmas:
add-at-ok
,
isarray-init-02
,
length-1init-01
,
length-init
,
okreftype-init-02
,
Used spec theorems:
okfuns
/
okarrayOfLength
valuesfuns
/
isbytelist-all
list-del
/javavalues/
in-get
list-del
/javavalues/
get-in
intnat
/
num-i2n-le-02
Used simplifier rules:
int-abs
/
lels-04
nat-basic1
/
z
intnat
/
num-n2i-ls-02
int-abs
/
forward-le-01
int-abs
/
forward-lels
intnat
/
n2n
intnat
/
nat2int-04
nat
/
lels
nat
/
ls-le-simp
intnat
/
nat2int-08
list-data
/javavalues/
l
nat-basic1
/
f
nat
/
ler
intnat
/
le
nat
/
lels-01
nat-basic1
/
ref-1
okfuns
/
oktype-byte
int-abs
/
lels
int-abs
/
lels-01
intnat
/
nat2int
javavalue
/
inj-04
store
/javastore/
In-store
javavalue
/
sel-09
storefuns
/
newref-01