[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 oplus-same-writes-eq
⊦ fowl0 |W = fowl1 |W → (v ⊕ fowl0 = v ⊕ fowl1 ↔ true)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
oplus-addFO
,
oplus-addFO-aux
,
oplus-addW
,
oplus-recW
,
oplus-v-append
,
Used by units in proved state:
abs-FLIT-FLITPSCweak
,
FLITPSCweak-refines-PLIB
,
abs-FLITPSCweak-PLIB
,
FLIT-refines-FLITPSCweak
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 25
Used lemmas:
overwrite-rec2
,
overwrite-rec1
,
overwrite-base
,
filterwrites-def
,
Used spec theorems:
Used simplifier rules:
filter-count
/
filter-base
list
/
c
list
/
a
list
/
e
list
/
app-02
filter-count
/
filter-rec
FOW
/
test-dotWque-W
FOW
/
test-dotWque-FO
filter-count
/
filter-in
list
/
in-14
list
/
in-17
list
/
Nil
list
/
in-append
list
/
in-rec
FOW
/
disj-FO-W
FOW
/
inj-W
list
/
c-06