[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-free
stat ≠ erasing ⊦ valid-eraseq(wlar, q0 + eq-entry(m, lref) ' + q1) → (valid-eraseq(wlar[m, wl-entry(m0, stat)], q0 + q1) ↔ ¬ m ∈ q0 ∧ ¬ m ∈ q1)
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: 6
Proof steps: 16
Used lemmas:
valid-eraseqw
,
Used spec theorems:
erasequeue
/
in-concat
Used simplifier rules:
array
/wlarray-base/
Size-put
array
/wlarray-base/
Put-same
wlentry
/
sel-04
erasequeue
/
in-concat
list
/erasequeue-base/
a
wlentry
/
elim-02
erasequeue
/
in-single
array
/wlarray-base/
Put-other
wlentry
/
inj-03
nat
/
lels
nat
/
le-ls-simp
array
/wlarray-base/
cgetput