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