[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: 43
Proof steps: 77
Used lemmas:
maplet
,
Used spec theorems:
map-sep
/
sharing
heapfuns-map
/
in-uni
heapfuns-map
/
at-uni
map
/
Extension
map
/
notmemlookup
map
/
At-other
Used simplifier rules:
map-sep
/
sharing-ass
map-sep
/
sharing-com
heapfuns-map
/
union-add-singleton-right
heapfuns-map
/
disj-emp-r
heapfuns-map
/
disj-write
map
/
In-empty
map
/
in-one
map
/
In-insert
heapfuns-map
/
in-uni
map
/
k-At-same
heapfuns-map
/
disj-emp-l
map
/
Del-rec-same
map
/
notin-del-notin
heapfuns-map
/
uni-emp-l
heapfuns-map
/
disj-r
heapfuns-map
/
at-uni
heapfuns-map
/
disj-distr-uni
heapfuns-map
/
disj-l
heapfuns-map
/
del-uni
heapfuns-map
/
uni-emp
heapfuns-map
/
disj-singleton-write
map
/
Del-empty
map
/
Del-in
heapfuns-map
/
union-left-singleton
map
/
eq-put2
map
/
Del-at
map
/
At-other