[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 isarray-addarray
⊦ (∀ j. 0 ≤ j ∧ j < n→i(# vals) → oktype(vals[i→n(j)], ty, st)) ∧ r ≠ jvmref → is_array(r, addarray(r, ty, vals, st))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
is_array-addarray-any
,
is_array-addarray-prim
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 12
Used lemmas:
oktype-addarray
,
isarray-init-02
,
isarray-init-01
,
add-at-ok
,
length-1init-01
,
length-init
,
okreftype-init-02
,
type-1init
,
add-in
,
Used spec theorems:
okfuns
/
is-any-array
okfuns
/
okarrayNotNull
Used simplifier rules:
int-abs
/
lels-04
int-abs
/
lels-03
okfuns
/
oktype-st
list-data
/javavalues/
l
nat-basic1
/
z
intnat
/
num-n2i-ls-02
int-abs
/
forward-le-01
int-abs
/
forward-le-05
intnat
/
le
nat
/
lels-01
nat-basic1
/
ref-1
nat
/
ler
nat
/
lels
intnat
/
nat2int-04
intnat
/
nat2int
javavalue
/
sel-04
javavalue
/
test-25
javatype
/
sel-01
javatype
/
test-09
javavalue
/
sel-11
javavalue
/
test-92
int-abs
/
lels
int-abs
/
lels-01