[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 take-first-vol-write-no-unpersisted-writes
⊦ ((h.take(firstVolWrite(l, h)))|W | l) | false = []
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
abs-FLITPSCweak-PLIB
,
PLIB-proofs
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 19
Proof steps: 40
Used lemmas:
firstVolWrite-def
,
restrict-vp
,
restrict-loc
,
restrict-W
,
Used spec theorems:
forall-indexWhere
/
indexWhere-rec2
list
/
some-element
forall-indexWhere
/
indexWhere-rec1
Used simplifier rules:
forall-indexWhere
/
indexWhere-base
list-del
/
firstN-zero
filter-count
/
filter-base
list
/
c
RWevent
/
sel-R-dotl
RWevent
/
test-dotWque-R
list
/
a
list
/
Nil
filter-count
/
filter-rec
nat-basic
/
c
nat-basic
/
a
list-del
/
weak-firstN-rec
filter-count
/
filter-in
RWevent
/
elim-W
RWevent
/
test-dotWque-W
RWevent
/
sel-W-dotl
list
/
app-02
filter-count
/
filter-append
filter-count
/
filter-one