[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 abs-def-reduce
⊦ abs(h, rs, p) → (abs(h0, rs0, p0) ↔ (∀ l. absloc(events((h | l) | false), rs(l), p(l)) → absloc(events((h0 | l) | false), rs0(l), p0(l))))
Type: A user defined theorem
Validity: The proof is valid.
Features: lss,
Comment: A generated reduce lemma variant for lemma: abs-def
Used by:
abs-addReadReader
,
abs-persist-firstPersistW
,
abs-persistFO-weak
,
abs-persistWrite
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 10
Used lemmas:
abs-def
,
Used spec theorems:
Used simplifier rules: