[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 allreadsok-ind-one
⊦ allReadsOKInd(mem, persisted, (e, b) ') ↔ e.W? ∨ e.R? ∧ e.v = mem(e.l) ∧ (b ↔ persisted(e.l))
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
allReadsOK-one
,
allreadsok-ind-add-read
,
allreadsok-ind-add-write
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
allReadsOKInd-recW
,
allReadsOKInd-base
,
allReadsOKInd-recR
,
Used spec theorems:
Used simplifier rules:
RWevent
/
sel-R-dotl
RWevent
/
sel-R-dotv
RWevent
/
test-dotRque-R
RWevent
/
test-dotWque-R
list
/
app
list
/
a
RWevent
/
test-dotWque-W