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