[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 exec-assign-wp
⊦ h1 ≡ h0(r := o1) ∧ r ∈ h0 → (hP(h1) ↔ (r.=>_ * (r => o1 -* hP))(h0))
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: 8
Proof steps: 15
Used lemmas:
free-unknown
,
eq
,
Used spec theorems:
map-sep
/
wand
map-maplet
/
maplet
heapfuns-map
/
union-add-singleton-left
map-ex-maplet
/
map-put
map-sep
/
sep-mp
Used simplifier rules:
map
/
Del-in
heapfuns-map
/
disj-singleton-write
map
/
del-put
map
/
eq-put2
map-ex-maplet
/
mapex-in
map-sep
/
sep-ass
map-sep
/
sep-com
map-maplet
/
map-write