[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-strong-notinvols
n < # apebs ⊦ (¬ v ∈ vtbl ∨ ¬ m < vtbl[v]) ∧ valid-eraseq-strong(apebs, vtbl, q) ∧ valid-peb(v, m, apebs[n]) ∧ ¬ n ∈ q → valid-eraseq-strong(apebs, vtbl, q + eq-entry(n, v × m) ')
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: 4
Proof steps: 17
Used lemmas:
valid-eraseq-strong-rec
,
valid-eraseq-strong-base
,
Used spec theorems:
list
/erasequeue-base/
One
list
/erasequeue-base/
c
Used simplifier rules:
list
/erasequeue-base/
Nil
erasequeueentry
/
sel-01
erasequeue
/
in-empty
erasequeueentry
/
sel-02
apeb
/
elim
lebref
/
inj
nat-basic
/
lf-02
nat-basic
/
f
erasequeue
/
in-concat
list
/erasequeue-base/
c
erasequeueentry
/
elim
list
/erasequeue-base/
a
erasequeue
/
in-append-other
erasequeue
/
in-single
valid-peb
/
valid-peb-unique