[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 map-del-sharing
⊦ (r => o ⊗ hP)(h) ↔ (hP(h -- r) ∨ hP(h)) ∧ r ∈ h ∧ h(r) = o
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: 27
Proof steps: 47
Used lemmas:
maplet
,
Used spec theorems:
heap-sep
/
sharing
heapfuns
/
in-uni
heapfuns
/
at-uni
heap
/
ext
Used simplifier rules:
heap-sep
/
sharing-ass
heap-sep
/
sharing-com
heap
/
nonnull
heapfuns
/
disj-emp-r
heapfuns
/
disj-write
heap
/
in-emp
heap
/
in-write
heapfuns
/
uni-emp-l
heapfuns
/
disj-emp-l
heap
/
put-eq
heap
/
in-alloc
heap
/
at-write
heapfuns
/
in-uni
heapfuns
/
at-uni
heapfuns
/
disj-r
heapfuns
/
disj-l
heapfuns
/
del-uni
heapfuns
/
uni-emp
heapfuns
/
disj-singleton-write
heap
/
write-del
heap
/
del-new
heap
/
del-notin
heap
/
in-del
heapfuns
/
union-left-singleton
heap
/
at-del