[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-putex
r ∈ H ⊦ (r => o0 * P)(H[r, o1]) ↔ ¬ ¬ (o0 = o1 ∧ (r =>_ * P)(H))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
map-put
,
map-put-rw
,
map-putex-simp
,
mapex-put-rw
,
Used by units in proved state:
separation-rg
,
separation
,
heap-fun
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 20
Proof steps: 37
Used lemmas:
mapex-in
,
ex3
,
mapex
,
maplet
,
map-write
,
Used spec theorems:
heap
/
ext
heap
/
at-uni
heap-sep
/
sep
heap
/
write-left
heap-sep
/
split-union
heap
/
disj
Used simplifier rules:
heap
/
overwrite
heap
/
at-uni
heap
/
at-write
heap
/
in-write-strong
heap
/
in-emp
heap
/
in-alloc
heap
/
in-uni
heap
/
nonnull
heap-sep
/
sep-ass
heap-sep
/
sep-com