[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 inv-unmap
ubi-cons(apebs, vols, wlar, q, bflipset, vtblpnum, sqnum), v ∈ vols, vtblpnum0 < # vols[v] ⊦ ⟪ubi_unmap#(v, vtblpnum0; vols, wlar, q, bflipset)⟫ ubi-cons(apebs, vols, wlar, q, bflipset, vtblpnum, sqnum)
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment:
Used by:
inv-erase
,
Used by units in proved state:
ubi-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 22
Used lemmas:
lf-used-valid-peb
,
lf-valid-wl-not-erroneous
,
wl-put-peb
,
lf-used-info
,
lf-mapped-info
,
lf-mapped-valid-peb
,
unmap
,
lf-vtbl-info
,
Used spec theorems:
Used simplifier rules:
ubi-base
/
ubi-cons
ubi-base
/
valid-vtbl-update-vols
store
/volumes/
In-insert
ebaentry
/
elim
nat-basic
/
lf-01
nat-basic
/
f
ebaentry
/
disj
wlentry
/
elim-02
ubi-base
/
valid-eraseqp-append
erasequeueentry
/
sel-02
ubi-base
/
valid-eraseqd-append
ubi-base
/
valid-vtbl-update-other-wlar
ubi-base
/
valid-ebatbl-unmap
set-union
/nat-set/
Delete
ubi-base
/
bitflip-cons-del
ubi-base
/
bitflip-cons-set
wlentry
/
sel-04
wlentry
/
sel-05
list
/erasequeue-base/
a
ubi-base
/
valid-eraseqw-unmap
wlstatus
/
disj-03
list
/erasequeue-base/
Last
ubi-base
/
valid-wl-erase
array
/wlarray-base/
Size-put
wlarray
/
elim-update-status
wlstatus
/
disj-02
valid-peb
/
valid-peb-vol
valid-peb
/
valid-peb-leb
apeb
/
elim