[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-eraseq-next-erasing
m < # wlar ⊦ valid-eraseq(subarray(wlar, 0, m), q) → valid-eraseq(subarray(wlar[m, wl-entry(m0, erasing)], 0, m + 1), q + eq-entry(m, lref) ')
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: 16
Used lemmas:
ls-at-subarray-wlar
,
valid-eraseqw
,
Used spec theorems:
Used simplifier rules:
nat
/
succ-01
array
/wlarray-base/
Size-put
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat
/
lels-03
array-copy
/wlarray-base/
size-subarray
wlentry
/
elim-02
array
/wlarray-base/
Put-same
wlentry
/
inj-03
erasequeue
/
in-append
list
/erasequeue-base/
a
erasequeue
/
in-append-other
array
/wlarray-base/
Put-other
nat-basic
/
ls-02
wlentry
/
sel-04
nat-basic
/
succ
oelem
/nat-set/
transitivity
nat-basic
/
lf
nat-basic
/
f
oelem
/nat-set/
sls
oelem
/nat-set/
irreflexivity