[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 okarrays-put
⊦ sk ≠ _type ∧ goodfieldandtype(r0, sk, st) ∧ oktype(val, sk .fs .type, st) ∧ ¬ sk ∈ fis ∧ sk ≠ _length → (okarrays(r, fis, st[r0 -- sk, val]) ↔ okarrays(r, fis, st))
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: 5
Proof steps: 17
Used lemmas:
good-index
,
okarray-put-08
,
okarrays-rec-01
,
okarrays-base
,
Used spec theorems:
storekey
/
ex-04
Used simplifier rules:
specialkeys
/
type-03
specialkeys
/
len
storekey
/
test-02
storekey
/
test
javatype
/
test-09
javatype
/
elim-01
javavalue
/
test-25
javavalue
/
elim-02
assoclist
/fieldinit/
inone
storekey
/
test-01
refkey
/
inj
javastore
/
lookup-if
list
/fieldinit-assoclista/
a
assoclist
/fieldinit/
in-append
list
/fieldinit-assoclista/
c
fieldspec
/
elim