[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 instore-afterputs
⊦ ¬ _type ∈ fv + fis ∧ instore(r, class, fv + fis, st) ∧ unique_al(fv + fis) ∧ st1 = st[r -- fv .1, refval(r1)] → instore(r, class, fis, st1) ∧ instore(r, class, (fv .1 × refval(r1)) ', st1)
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: 14
Proof steps: 30
Used lemmas:
inst-in
,
instore-null
,
inst-single
,
instore-rec-03
,
instore-empty
,
instore-rec-02
,
Used spec theorems:
Used simplifier rules:
store
/javastore/
At-same
javavalue
/
inj-03
list
/fieldinit-assoclista/
app
pair
/fieldinit/
sel-01
pair
/fieldinit/
sel-02
refkey
/
inj-01
store
/javastore/
In-insert
store
/javastore/
in-pair
javastore
/
instore-02
javastore
/
at-other-16
assoclist
/fieldinit/
empty
assoclist
/fieldinit/
unique-e
storefuns
/
instore-01
store
/javastore/
In-store
assoclist
/fieldinit/
inone
assoclist
/fieldinit/
cons
list
/fieldinit-assoclista/
a
assoclist
/fieldinit/
in-append
list
/fieldinit-assoclista/
c
pair
/fieldinit/
elim