[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 owns-one-map
⊦ owns-one(a, r, rs, g) → (∀ f. ∃ o. (a[r => o] * true)[rs, f, g])
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: 7
Proof steps: 13
Used lemmas:
owns-one
,
Used spec theorems:
heap-aux
/
sep
heap-aux
/
apply
embed-aux
/
lift-aux
heap
/
ext
heap-fun
/
at-mk
Used simplifier rules:
heap-aux
/
prop-true
set-union
/refset/
One
set-union
/refset/
int-c
set-union
/refset/
int-a
set-union
/refset/
del-e-01
set-union
/refset/
int-e
set-union
/refset/
intersect-add-rem
set-union
/refset/
unc
set-union
/refset/
una
set-union
/refset/
del-addeq-02
set-union
/refset/
une
set-union
/refset/
unadd
maplet
/
maplet-singleton-heap
set-basic
/refset/
in-04
heap
/
in-alloc
heap
/
in-emp
heap
/
at-write
heap-fun
/
in-mk
heap
/
in-write