[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
⊦ ((r => o * hP))(h) ↔ hP(h -- r) ∧ r ∈ h ∧ h[r] = o
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
map-putex
,
Used by units in proved state:
heap-fun
,
linked-list
,
separation
,
heap-aux
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
maplet
,
map-in
,
Used spec theorems:
heap-sep
/
sep
Used simplifier rules:
heap-sep
/
sep-com
heap-sep
/
sep-ass
heap
/
del-uni
heap
/
in-uni
heap
/
at-uni
heap
/
disj-singleton-write
heap
/
write-del
heap
/
del-new
heap
/
del-notin
heap
/
uni-emp-l
heap
/
in-write
heap
/
at-write
heap
/
in-emp
heap
/
in-alloc
heap
/
nonnull
heap
/
in-del
heap
/
union-left-singleton