[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-all
⊦ okarrays(r, fis, st) ↔ (∀ sk, val. sk × val ∈ fis → is_integervalue(val) ∧ is_fskey(sk) ∧ is_arraytype(sk .fs .type) ∧ okarray(st[r -- sk], sk .fs .type .type, val .intval, st))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
okarrays-mode
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 20
Used lemmas:
okarrays-rec
,
okarrays-base
,
Used spec theorems:
Used simplifier rules:
fieldspec
/
sel-03
javavalue
/
sel-04
storekey
/
test-02
storekey
/
test
fieldspec
/
inj
javavalue
/
test-25
javavalue
/
elim-02
fieldspec
/
elim
pair
/fieldinit/
inj
storekey
/
test-01
list
/fieldinit-assoclista/
a
list
/fieldinit-assoclista/
in-17
list
/fieldinit-assoclista/
in-append
list
/fieldinit-assoclista/
c
list
/fieldinit-assoclista/
in-empty