[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 abs-leading-write-h-restricted-non-empty
⊦ abs(h, rs, p) ∧ p(l) = W(v, t) ' + fowl → (h |W | l) | false ≠ []
Type: A user defined theorem
Validity: The proof is valid.
Features: as, las,
Comment:
Used by:
abs-persistWrite
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 29
Used lemmas:
absloc-recR
,
absloc-base
,
abs-def
,
Used spec theorems:
FLITPSC-preds
/
filterwrites-def
Used simplifier rules:
list
/
a
list
/
in-14
PLIB-preds
/
events-empty
PLIB-preds
/
restrict-b-empty
PLIB-preds
/
restrict-l-empty
PLIB-preds
/
restrict-W-empty
filter-count
/
filter-rec
FOW
/
test-dotWque-W
list
/
app-02
list
/
e
PLIB-preds
/
events-append
PLIB-preds
/
restrict-b-append
PLIB-preds
/
restrict-l-one
PLIB-preds
/
restrict-l-append
list
/
c
PLIB-preds
/
restrict-write-one
PLIB-preds
/
restrict-W-append
list
/
Nil
RWevent
/
elim-W
RWevent
/
test-dotWque-W
PLIB-preds
/
restrict-bool-one
PLIB-preds
/
events-one
RWevent
/
sel-W-dotl
RWevent
/
test-dotWque-R
RWevent
/
sel-R-dotl