[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 eqex-tput
⊦ eqex(st, st0, r) ∧ eqex(st0[rk, val], st1, r) → eqex(st[rk, val], st1, r)
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 20
Proof steps: 39
Used lemmas:
eqex
,
eqex-ref
,
eqex-trans
,
eqex-sym
,
Used spec theorems:
store
/javastore/
Extension
storefuns
/
look-del
store
/javastore/
notmemlookup
store
/javastore/
In-insert
Used simplifier rules:
storefuns
/
instore-01
store
/javastore/
insin
store
/javastore/
notmemlookup
storefuns
/
in-del
store
/javastore/
In-insert
refkey
/
inj-01
storefuns
/
look-del
javastore
/
lookup-if
refkey
/
inj