[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-map-indices-nostatchange
⊦ valid-eraseq(wlar, q) ∧ (∀ wle. f(wle).status = wle.status) ∧ valid-indices(wlar, nx) ∧ ¬ dups(nx) → valid-eraseq(wlar.mapIndices(nx, f), q)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
ubi-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 14
Used lemmas:
Used spec theorems:
ubi-base
/
valid-eraseqw
array-indices
/wlarray-base/
map-indices-size
array-indices
/wlarray-base/
map-indices-at
Used simplifier rules:
wlentry
/
elim-02
nat-basic
/
f
wlentry
/
inj-03
wlentry
/
sel-04