[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-update-wlar-unused
stat ≠ used, stat0 ≠ used ⊦ wlar[m] = wl-entry(m0, stat) → (valid-ebatbl(apebs, wlar[m, wl-entry(m1, stat0)], vols, n) ↔ valid-ebatbl(apebs, wlar, vols, n))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss,
Comment:
Used by:
Used by units in proved state:
ubi-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 22
Used lemmas:
valid-ebatbl
,
Used spec theorems:
Used simplifier rules:
array
/wlarray-base/
Size-put
apeb
/
elim
wlentry
/
elim-02
array
/wlarray-base/
cgetput
wlentry
/
inj-03
array
/wlarray-base/
Put-same
nat-basic
/
lf-02
nat-basic
/
f
nat
/
lels
nat
/
le-ls-simp
array
/wlarray-base/
Put-other
wlentry
/
sel-04
apeb
/
sel-05