[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-wl-erasing-invalidate
m < # apebs ⊦ # apebs = # wlar ∧ ¬ valid-peb(apeb) ∧ valid-wl(apebs, wlar) ∧ wlar[m] = wl-entry(m0, erasing) ∧ ¬ apeb.bad → valid-wl(apebs[m, apeb], wlar)
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: 4
Proof steps: 23
Used lemmas:
valid-wl
,
Used spec theorems:
sqns
/
valid-sqns-write
sqns
/
valid-sqns-extract2-sqn
bag-max
/
max-rec
Used simplifier rules:
nat-basic
/
lf-01
array
/apebs/
cngetput
array
/apebs/
Put-same
apeb
/
elim
wlentry
/
elim-02
nat
/
ls-le-simp
array
/apebs/
cgetput
wlentry
/
inj-03
wlstatus
/
disj-06
wlstatus
/
disj-05
apeb
/
inj
array
/apebs/
Put-other
wlstatus
/
disj-03
wlstatus
/
disj-01
wlstatus
/
disj-02
wlentry
/
sel-05
apeb
/
sel-04
apeb
/
sel-08
wlentry
/
sel-04
nat
/
fle-01
bag-union
/nat-bag/
union-com
bag-union
/nat-bag/
union-ass
bag-union
/nat-bag/
union-empty
valid-peb
/
valid-peb-imp-valid-peb0
bag-union
/nat-bag/
diff-empty
bag-max
/
bag-diff-one
nat-basic
/
f
bag-max
/
max-add-one-different
bag-union
/nat-bag/
del-rec
apeb
/
sel-05
valid-peb
/
valid-peb-unique
bag-max
/
bag-add-nonempty
bag-max
/
max-rec-simp
nat
/
gr-def
nat-basic
/
lf-02
oelem
/nat-set/
irreflexivity
nat
/
lels
nat
/
fle
nat
/
le-ls-simp