[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 wlar-erase-worker-helper
wlar0 = wlar, n < # wlar ⊦ [ubi_erase_worker_helper#(n; wlar, apebs; err)] ∃ m, stat. m ≠ 0 ∧ m ≤ UBI_ERASE_RETRIES + 1 ∧ wlar = wlar0[n, wl-entry(wlar0[n].ec + m, stat)]
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
delta-erase-worker-helper
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 341
Used lemmas:
Used spec theorems:
debug
/
debug
Used simplifier rules:
wlentry
/
elim-02
wlarray
/
elim-update-status
error
/
disj-66
nat
/
lez
apeb
/
elim
wlentry
/
updsel-02
nat-basic
/
lf-02
array
/apebs/
cputput
apeb
/
upd-04
ubi-io-pre
/
write-echdr-pre
array
/apebs/
Put-same
apeb
/
sel-08
aecheader
/
test-02
apeb
/
sel-04
array
/apebs/
Size-put
nat
/
le-sum
oelem
/nat-set/
irreflexivity
nat-basic
/
s-04
nat-basic
/
lf-01
nat
/
eqle-one
nat
/
les
nat
/
le-def
error-class
/
esuccess
nat-basic
/
oz
nat
/
lep-02
nat
/
ler
error-class
/
not-esuccess
wlentry
/
upd-04
nat-basic
/
c
nat-basic
/
a
nat
/
lep
ubi-io-pre
/
erase-pre
nat-basic
/
f
array
/wlarray-base/
cputput
nat
/
ls-le-simp
nat
/
lels
wlentry
/
sel-05
array
/wlarray-base/
Put-same
array
/wlarray-base/
Size-put
array-copy
/wlarray-base/
idexcept-same
array-copy
/wlarray-base/
idexcept-write-at0-right
ubi-io-pre
/
markbad-pre