[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-eraseq
⊦ indices-erasing(wlar0, nx) ∧ valid-eraseq(wlar0, q0) ∧ valid-eraseq(wlar1, q1) ∧ q0 ⊆ q1 → indices-erasing(wlar1, nx)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
ubi-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 24
Used lemmas:
indices-erasing-rec
,
indices-erasing-base
,
Used spec theorems:
list-set
/erasequeue-base/
subset
ubi-base
/
valid-eraseqw
erasequeue
/
queue-in
Used simplifier rules:
nat-basic
/
f
list
/nat-list-set/
a
list
/nat-list-set/
c
wlentry
/
elim-02
wlentry
/
sel-04
erasequeueentry
/
elim
erasequeueentry
/
sel-02