[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 subset-putarray-addarray-newref
⊦ newref(r, st) → st ⊆ putArray(vals0, r, i, addarray(r, ty, vals, 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: 10
Used lemmas:
addarray-at-newref
,
in-init-09
,
Used spec theorems:
store
/javastore/
Subset
store
/javastore/
notmemlookup
store
/javastore/
superset-elem-eq
storearrays
/
putar-atref
Used simplifier rules:
storefuns
/
newref-03
storefuns
/
instore-01
store
/javastore/
sub-ref
storefunsx
/
lookup-xtra
storearrays
/
putArray-in
storefuns
/
newref-01