[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-stronger-one
⊦ valid-eraseq-stronger(apebs, eq-entry(m, lref) ') ↔ m < # apebs ∧ (lref = none → ¬ valid-peb(apebs[m])) ∧ (lref ≠ none → valid-peb(lref.vol, lref.leb, apebs[m]) ∧ apebs[m].vidhdr.sqn ≠ valid-sqns(lref.vol, lref.leb, apebs).max)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
valid-eraseq-stronger-next-append-lref
,
valid-eraseq-stronger-next-append-none
,
valid-eraseq-stronger-prev-append-lref
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 23
Used lemmas:
valid-eraseq-stronger-base
,
valid-eraseq-stronger-rec
,
Used spec theorems:
list
/erasequeue-base/
One
list
/erasequeue-base/
c
valid-peb
/
valid-peb0
Used simplifier rules:
apeb
/
elim
apeb
/
sel-05
nat-basic
/
f
erasequeueentry
/
sel-01
erasequeue
/
in-empty
erasequeueentry
/
sel-02
lebref
/
elim
lebref
/
disj
lebref
/
sel-02
lebref
/
sel-01
valid-peb
/
valid-peb-unique
valid-peb
/
valid-peb-imp-valid-peb0