[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 delta-erase-worker-helper
wlar0 = wlar, n < # wlar, wlar[n].ec + UBI_ERASE_RETRIES < ecs(wlar).max ⊦ [ubi_erase_worker_helper#(n; wlar, apebs; err)] ∃ m, stat. m ≠ 0 ∧ m ≤ UBI_ERASE_RETRIES + 1 ∧ Δ wlar + m = Δ wlar0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
delta-wear-leveling
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 18
Used lemmas:
wlar-erase-worker-helper
,
Used spec theorems:
ubi-quality-base
/
delta-write
ubi-quality-base
/
in-delta
Used simplifier rules:
wlentry
/
elim-02
wlentry
/
inj-03
nat-basic
/
nls-fst
nat-basic
/
lf
oelem
/nat-set/
transitivity
nat-basic
/
succ
wlentry
/
sel-05
nat
/
eq-02
nat
/
le-ls-simp
nat
/
le-one
nat-basic
/
l-06
nat
/
lep-02
nat-basic
/
l
nat-basic
/
l-01
nat-basic
/
a
nat-basic
/
eq-01
nat-basic
/
lf-01
nat-basic
/
f
nat
/
lels-03
nat
/
elim-sub
nat
/
le-def
nat-basic
/
c