[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-unmap
⊦ v ∈ vols ∧ m < # vols[v] ∧ vols[v][m] = ⌜n⌝ ∧ abs(avols, apebs, vols, q) → abs(avols[v, avols[v][m, unmapped]], apebs, vols[v, vols[v][m, unmapped]], q + eq-entry(n, 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: 3
Proof steps: 12
Used lemmas:
abs-def
,
Used spec theorems:
Used simplifier rules:
apeb
/
elim
store
/volumes/
In-insert
store
/abstract-volumes/
In-insert
store
/volumes/
At-other
store
/volumes/
in-neq
store
/abstract-volumes/
in-neq
store
/abstract-volumes/
At-other
nat-basic
/
f
array
/abstract-volume/
cngetput
array
/ebatbl/
cngetput
nat-basic
/
lf-01
array
/ebatbl/
Put-same
array
/abstract-volume/
Size-put
store
/abstract-volumes/
At-same
array
/ebatbl/
Size-put
store
/abstract-volumes/
insin
store
/volumes/
insin
store
/volumes/
At-same
array
/ebatbl/
Put-other
array
/abstract-volume/
Put-other
apeb
/
inj
erasequeue
/
in-vl-append
lebref
/
inj
list
/erasequeue-base/
a
nat
/
lels
nat
/
ls-le-simp
array
/ebatbl/
cgetput
array
/abstract-volume/
Put-same
leb
/
test-01
leb
/
disj-02