[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 inv-erase
mtd-cons(pebs), m < # pebs, ¬ pebs[m].bad ⊦ ⟪mtd_asm_erase#(m; pebs; err)⟫ mtd-cons(pebs)
Type: A proof obligation
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 19
Used lemmas:
reduce-mtd-cons
,
erase
,
Used spec theorems:
Used simplifier rules:
peb
/
elim
peb
/
sel-05
error-class
/
esuccess
mtd-base
/
mtd-valid-peb
array
/pebs/
Size-put
array
/pebs/
Put-other
nat
/
lels
nat
/
ls-le-simp
mtd-base
/
mtd-cons-peb-size
peb
/
inj
nat
/
le-def
nat-basic
/
lf-01
nat
/
fle-01
nat-basic
/
f
nat
/
le-ls-simp
array
/pebs/
Put-same
eraseblock
/
emptypeb-size
nat
/
lez
eraseblock
/
page-size
align
/
is-aligned-zero
nat
/
sub-base
array-splice
/buffer/
range-eq-refl
nat-basic
/
add-base
nat-basic
/
a
nat-basic
/
c
nat
/
ler
error
/
disj-91
error-class
/
ecommit