[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 absexpt-v-vols-write
⊦ ¬ v ∈ vols ∧ ¬ v ∈ avols ∧ # evol = # ebatbl → (abs○(avols[v, evol], apebs, vols[v, ebatbl], q, v) ↔ abs○(avols, apebs, vols, q, v))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 19
Used lemmas:
absexpt-v-def
,
Used spec theorems:
Used simplifier rules:
apeb
/
elim
store
/abstract-volumes/
At-in-out
store
/volumes/
At-other
apeb
/
sel-06
apeb
/
sel-07
store
/volumes/
notmemlookup
store
/volumes/
In-insert
store
/abstract-volumes/
insin
store
/abstract-volumes/
In-insert
store
/volumes/
insin
store
/volumes/
At-same
store
/abstract-volumes/
At-same
store
/abstract-volumes/
At-other
store
/volumes/
At-in-out
store
/abstract-volumes/
in-neq
store
/volumes/
in-neq
nat-basic
/
lf-01
nat-basic
/
f