[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 write-known-p
⊦ rely(me, hO1, h1(r := o1), hO2, h2) → ((!(me, hO2, r => o0 * hP) * hP0)(h1) ↔ (!(me, hO2, r => o1 * hP) * hP0)(h1(r := o1)) ∧ h1(r) = o0 ∧ r ∈ h1)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
write-known
,
write-unknown-p
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 18
Proof steps: 38
Used lemmas:
owned
,
Used spec theorems:
heap-sep
/
sep
heapfuns
/
write-left
heap-sep
/
split-union
heapfuns
/
disj
ex-maplet
/
map-putex
Used simplifier rules:
heapfuns
/
at-uni
heapfuns
/
in-uni
maplet
/
map-in
maplet
/
at-rw
heap-sep
/
sep-ass
heap-sep
/
sep-com
heapfuns
/
disj-r
heap
/
in-write
maplet
/
map-write
maplet
/
map-put-rw
ex-maplet
/
mapex-elim
ex-maplet
/
mapex-in
heap
/
at-write
heap
/
write-again
heap
/
overwrite