[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-addWriteFO
⊦ (∀ e. e ∈ el ∧ e.R? → e.t ≠ t) → (absloc(el, rset, fowl + FO(t) ') ↔ absloc(el, rset, fowl))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
abs-addWriteFO
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 26
Used lemmas:
absloc-recW-W
,
absloc-recW-FO
,
absloc-recW-empty
,
absloc-recW-FO-one2
,
absloc-recR
,
absloc-base
,
Used spec theorems:
Used simplifier rules:
FLITPSC-preds
/
filter-W-append
FLITPSC-preds
/
filter-W-one-fo
list
/
app
list
/
a
list
/
in-rec
list
/
c
FOW
/
inj-FO
list
/
in-17
list
/
in-append
RWevent
/
inj-R
RWevent
/
test-dotRque-R
RWevent
/
sel-R-dott
RWevent
/
elim-R
list
/
Nil
RWevent
/
disj-R-W