[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 absloc-addWrite
⊦ absloc(el + W(t, l, v) ', rset, fowl + W(v, t) ') ↔ absloc(el, rset, fowl)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
abs-addWrite
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 27
Used lemmas:
absloc-recW-W
,
absloc-recW-FO
,
absloc-recW-empty-one
,
absloc-recW-empty
,
absloc-recW-W-one2
,
absloc-recR
,
absloc-recW-W-one
,
absloc-recW-FO-one
,
absloc-recW-W-one3
,
absloc-base
,
Used spec theorems:
Used simplifier rules:
list
/
a
list
/
Nil
FLITPSC-preds
/
filter-w-empty
list
/
app-02
FLITPSC-preds
/
filter-W-append
list
/
c
FLITPSC-preds
/
filter-W-one-w
list
/
e
FLITPSC-preds
/
filter-W-one-fo
FOW
/
disj-FO-W
list
/
in-17
list
/
in-append
set-basic
/
size-zero-01
set-basic
/
ne-01
list
/
in-empty