[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 first-vol-write-head-restricted
⊦ (h |W | l) | false ≠ [] → h[firstVolWrite(l, h)] = ((h |W | l) | false).head
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 24
Used lemmas:
first-vol-write-rec-read
,
first-vol-write-rec-write-other
,
first-vol-write-rec-write-unpersisted
,
first-vol-write-rec-write-persisted
,
hist-ind
,
restrict-vp
,
restrict-loc
,
restrict-W
,
Used spec theorems:
Used simplifier rules:
list-data
/
elim-add
filter-count
/
filter-in
list
/
a
list
/
in-14
list
/
e
list
/
app-02
list
/
c
RWevent
/
elim-W
RWevent
/
sel-W-dotl
RWevent
/
test-dotWque-W
filter-count
/
filter-base
list
/
in-empty
list
/
in-append
list
/
in-rec
nat-basic
/
c
nat-basic
/
a
list-del
/
get-succ
filter-count
/
filter-append
filter-count
/
filter-rec
list
/
Nil
filter-count
/
filter-one
list
/
c-06
list-del
/
get-zero
RWevent
/
inj-W
RWevent
/
test-dotWque-R
RWevent
/
disj-R-W