[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-split
⊦ firstVolWrite(l, h) < # h → (∃ t, v. h = h.take(firstVolWrite(l, h)) + ((W(t, l, v), false) + h.drop(firstVolWrite(l, h) + 1)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
FLITPSCweak-refines-PLIB
,
abs-FLITPSCweak-PLIB
,
PLIB-proofs
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 16
Proof steps: 39
Used lemmas:
firstVolWrite-def
,
Used spec theorems:
RWevent
/
ex-dotWque
forall-indexWhere
/
indexWhere-rec2
forall-indexWhere
/
indexWhere-rec1
Used simplifier rules:
list-data
/
l
nat-basic
/
f
list
/
a
list
/
c
nat-basic
/
c
nat-basic
/
a
list-del
/
weak-restN-rec
nat
/
lels
nat-basic
/
s-04
nat-basic
/
succ
list
/
len-05
list
/
e
list
/
app-02
list
/
c-04
list
/
app
list
/
Nil
list-del
/
restN-zero
list-del
/
firstN-zero
nat
/
lez-01
list-data
/
size-nil
forall-indexWhere
/
indexWhere-one
RWevent
/
sel-W-dotl
RWevent
/
sel-R-dotl
RWevent
/
test-dotWque-R
list
/
len-01
list-del
/
weak-firstN-rec
nat
/
succ-01
RWevent
/
test-dotWque-W
list
/
len-06
nat
/
lez