[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, a) * hR)[rs, f, g] ↔ hR[rs -- r, f, g] ∧ r ∈ rs ∧ f(r) = o ∧ g(r) = a
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: 1
Proof steps: 5
Used lemmas:
modifysep-def
,
maplet-def
,
Used spec theorems:
heap-fun
/heap-aux-inst/
map-del
Used simplifier rules:
heap-sep
/heap-aux-inst/
sep-ass
heap-sep
/heap-aux-inst/
sep-com
set-union
/refset/
del-in
heap-fun
/heap-aux-inst/
map-in
set-basic
/refset/
size-zero-01
set-basic
/refset/
ne-01
obj-aux
/
inj-timtim