[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 mapped-pebs-unmap
⊦ v ∈ vols ∧ m < # vols[v] ∧ vols[v][m] = ⌜n0⌝ ∧ valid-ebatbl(apebs, wlar, vols, m0) → mapped-pebs(vols[v, vols[v][m, unmapped]]) = mapped-pebs(vols) -- n0
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
ubi-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 43
Used lemmas:
mapped-pebs
,
valid-ebatbl
,
Used spec theorems:
set-basic
/nat-set/
Extension
store
/volumes/
At-other
array
/ebatbl/
Put-other
Used simplifier rules:
set-union
/nat-set/
Delete
array
/ebatbl/
Put-other
avidheader
/
elim
apeb
/
elim
wlentry
/
elim-02
nat-basic
/
lf-02
avidheader
/
sel-08
nat-basic
/
f
store
/volumes/
At-other
avidheader
/
sel-06
avidheader
/
test-03
apeb
/
sel-05
wlentry
/
sel-04
store
/volumes/
In-insert
store
/volumes/
in-neq
array
/ebatbl/
Size-put
store
/volumes/
At-same
store
/volumes/
insin
array
/ebatbl/
Put-same
ebaentry
/
disj
ebaentry
/
inj