[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, O1, H1[r, o1], O2, H2) → (((!(me, O2, r => o0 * P) * P0))(H1) ↔ ((!(me, O2, r => o1 * P) * P0))(H1[r, o1]) ∧ H1[r] = o0 ∧ r ∈ H1)
Type: A user defined theorem
Validity: The proof is valid.
Features: ws, lws,
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: 19
Proof steps: 39
Used lemmas:
owned
,
Used spec theorems:
heap-sep
/
split-union
heap-sep
/
sep
heap
/
disj
heap
/
write-left
heap
/
write-again
maplet
/
map-putex
Used simplifier rules:
heap
/
in-uni
maplet
/
at-eq
heap
/
disj-r
maplet
/
mapex-elim
heap
/
at-write
heap
/
in-write
heap
/
at-uni
maplet
/
map-in
heap-sep
/
sep-com
heap-sep
/
sep-ass
heap
/
overwrite