[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-eraseqw-update-ec
⊦ wlar[m] = wl-entry(m0, stat) → (valid-eraseq(wlar[m, wl-entry(m1, stat)], q) ↔ valid-eraseq(wlar, q))
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: 19
Used lemmas:
valid-eraseqw
,
Used spec theorems:
Used simplifier rules:
array
/wlarray-base/
Size-put
wlentry
/
elim-02
array
/wlarray-base/
cgetput
nat-basic
/
f
wlentry
/
inj-03
array
/wlarray-base/
Put-same
wlentry
/
sel-04
nat
/
lels
nat
/
le-ls-simp
array
/wlarray-base/
Put-other