[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 assign-wp
h1 ≡ h0(r := o) ∧ r ∈ h0 ⊦ hP(h1) ↔ ((r => o -* hP) * r.=>_)(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: 14
Proof steps: 25
Used lemmas:
eq
,
Used spec theorems:
heap-sep
/
sep
heap
/
exin
heap-sep
/
wand
maplet
/
maplet
ex-maplet
/
mapex
Used simplifier rules:
heap
/
sanity
heap
/
overwrite
heapfuns
/
union-add-singleton-right
heapfuns
/
disj-emp-r
heapfuns
/
disj-write
heap
/
in-emp
heapfuns
/
disj-singleton-write
heapfuns
/
union-add-singleton-left
maplet
/
ex
maplet
/
maplet
ex-maplet
/
mapex-in
heap-sep
/
sep-ass
heap-sep
/
sep-com