[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 in-eraseq-strong-valid
⊦ eq-entry(n, v × m) ∈ q ∧ valid-eraseq-strong(apebs, to-vtbl(vols), q) → valid-peb(v, m, apebs[n]) ∧ (v ∈ vols ∧ m < # vols[v] → apebs[n].vidhdr.sqn ≠ valid-sqns(v, m, apebs).max)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
vols-is-max-is-min-eraseq
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 13
Used lemmas:
valid-eraseq-strong-rec
,
Used spec theorems:
Used simplifier rules:
list
/erasequeue-base/
in-empty
nat-basic
/
f
vtbl-conv
/
to-vtbl-at
vtbl-conv
/
to-vtbl-in
list
/erasequeue-base/
a
list
/erasequeue-base/
in-rec
list
/erasequeue-base/
c
erasequeueentry
/
elim
apeb
/
elim
apeb
/
sel-05
nat-basic
/
lf-02
erasequeueentry
/
inj
valid-peb
/
valid-peb-unique