[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 valid-ebatbl-unmap
⊦ v ∈ vols ∧ m < # vols[v] ∧ vols[v][m] = ⌜n⌝ ∧ valid-ebatbl(apebs, wlar, vols, n0) → valid-ebatbl(apebs, wlar[n, wl-entry(m0, erasing)], vols[v, vols[v][m, unmapped]], n0)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
ubi-refine
,
ubi-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 53
Used lemmas:
valid-ebatbl
,
Used spec theorems:
Used simplifier rules:
array
/wlarray-base/
Size-put
wlentry
/
elim-02
apeb
/
elim
wlstatus
/
disj-03
wlentry
/
inj-03
array
/wlarray-base/
Put-same
array
/ebatbl/
Size-put
store
/volumes/
insin
store
/volumes/
At-same
array
/ebatbl/
Put-other
avidheader
/
elim
nat
/
lels
nat
/
le-ls-simp
array
/wlarray-base/
Put-other
ebaentry
/
disj
array
/ebatbl/
Put-same
nat-basic
/
lf-02
nat-basic
/
f
avidheader
/
sel-08
avidheader
/
test-03
avidheader
/
sel-06
ebaentry
/
inj
wlentry
/
sel-04
apeb
/
sel-05
store
/volumes/
in-neq
store
/volumes/
At-other