[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-size
⊦ firstVolWrite(l, h) < # h ↔ (h |W | l) | false ≠ []
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
first-vol-write-size2
,
Used by units in proved state:
FLITPSCweak-refines-PLIB
,
abs-FLITPSCweak-PLIB
,
PLIB
,
PLIB-proofs
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 30
Used lemmas:
hist-ind
,
firstVolWrite-def
,
restrict-vp
,
restrict-loc
,
restrict-W
,
Used spec theorems:
forall-indexWhere
/
indexWhere-rec2
forall-indexWhere
/
indexWhere-rec1
Used simplifier rules:
filter-count
/
filter-base
list-data
/
size-nil
forall-indexWhere
/
indexWhere-base
list
/
a
list
/
app-02
filter-count
/
filter-append
RWevent
/
sel-W-dotl
filter-count
/
filter-rec
RWevent
/
test-dotWque-W
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat-basic
/
succ
list
/
len-05
filter-count
/
filter-one
nat
/
lels
list
/
e
list-data
/
l
nat-basic
/
f
nat
/
succ-01
nat-basic
/
less-zero
nat-basic
/
trans-Nat
nat-basic
/
lf
nat-basic
/
refl-Nat
list
/
Nil
RWevent
/
test-dotWque-R
RWevent
/
sel-R-dotl