[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-erasing-at
⊦ n ∈ nx ∧ indices-erasing(wlar, nx) → wlar[n].status = erasing
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
valid-vtbl-map-indices-erasing
,
valid-wl-map-indices
,
Used by units in proved state:
ubi-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 10
Used lemmas:
indices-erasing-rec
,
Used spec theorems:
Used simplifier rules:
wlentry
/
elim-02
list
/nat-list-set/
in-empty
nat-basic
/
f
list
/nat-list-set/
a
list
/nat-list-set/
in-rec
list
/nat-list-set/
c
wlentry
/
inj-03