[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 getarray-in
⊦ val ∈ getarray(r, st) ↔ (∃ i. 0 ≤ i ∧ i < st[r -- _length] .intval ∧ st[r -- i '] = val)
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:
get-empty
,
getArray-all
,
getarray-length
,
getarray-get
,
Used spec theorems:
list-del
/javavalues/
in-get
intnat
/
num-n2i-ls-06
intnat
/
num-i2n-le-02
Used simplifier rules:
intnat
/
i2i-pos
int-abs
/
lels-03
intnat
/
i2i-pos-01
int-abs
/
forward-lels
nat
/
lels
nat
/
ls-le-simp
nat-basic1
/
z
intnat
/
num-n2i-ls-02
int-abs
/
forward-le
intnat
/
nat2int-08
int-abs
/
forward-le-05
int-abs
/
lels-02
intnat
/
abs-zero
int-abs
/
forward-le-01
int-basic1
/
ls-01
int-abs
/
forward-le-02
list-data
/javavalues/
l
nat-basic1
/
f
int-abs
/
lels
int-abs
/
lels-01