[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 indices-set-erasing
⊦ indices-erasing(wlar, nx) → indices-erasing(wlar[m, wl-entry(n, erasing)], nx)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
indices-erasing-write-prepend
,
Used by units in proved state:
ubi-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 14
Used lemmas:
indices-erasing-rec
,
indices-erasing-base
,
Used spec theorems:
array
/wlarray-base/
Put-other
Used simplifier rules:
nat-basic
/
f
list
/nat-list-set/
a
list
/nat-list-set/
c
wlentry
/
elim-02
array
/wlarray-base/
Put-same
nat
/
lels
nat
/
ls-le-simp
array
/wlarray-base/
Size-put
wlentry
/
inj-03