[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, O1, H1, O2, H2) ∧ (!(me, O2, P) * P0)(H1) → ((!(id, O2, P1) * true)(H2) ↔ (!(me, O2, P) * !(id, O2, P1) * true)(H2))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 25
Proof steps: 42
Used lemmas:
owned-r
,
rely
,
Used spec theorems:
heap-sep
/
sep
heap
/
subset-uni
heap-sep
/
split-union
heap
/
ext
heap
/
in-uni
heap
/
at-uni
heap
/
subset
Used simplifier rules:
heap
/
disj-l
heap
/
disj-r
heap
/
at-uni
heap
/
in-uni
heap-sep
/
trueH
heap
/
disj-swap
heap-sep
/
true-elim
heap-sep
/
sep-com
heap-sep
/
sep-ass