[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-addWriteFO
⊦ ((h | t) | false)|R = [] → (abs(h, rs, p(l := p(l) + FO(t) ')) ↔ abs(h, rs, p))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
FLITPSCweak-refines-PLIB
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 26
Used lemmas:
absloc-addWriteFO
,
abs-def
,
Used spec theorems:
PLIB-preds
/
restrict-events
PLIB-preds
/
restrict-vp
PLIB-preds
/
restrict-loc
list
/
some-element
PLIB-preds
/
restrict-R
PLIB-preds
/
restrict-thread
Used simplifier rules:
list
/
a
list
/
map-in
filter-count
/
filter-in
RWevent
/
sel-W-dott
RWevent
/
test-dotRque-W
RWevent
/
test-dotRque-R
RWevent
/
sel-R-dott
RWevent
/
sel-R-dotl