[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 propagate
⊦ id ≠ me ∧ rely(me, hO1, h1, hO2, h2) ∧ ((!(me, hO2, hP) * hP0))(h1) → (((!(id, hO2, hP1) * true))(h2) ↔ ((!(me, hO2, hP) * !(id, hO2, hP1) * true))(h2))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 23
Proof steps: 41
Used lemmas:
owned-r
,
rely
,
Used spec theorems:
heap-sep
/
sep
heap
/
subset-uni
heap-sep
/
split-union
heap
/
subset
heap
/
ext
heap
/
at-uni
heap
/
in-uni
Used simplifier rules:
heap-sep
/
sep-com
heap-sep
/
sep-ass
heap-sep
/
true-elim
heap
/
disj-com-rw
heap-sep
/
trueH
heap
/
in-uni
heap
/
at-uni
heap
/
disj-r
heap
/
disj-l