[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
,
Proof step 36 from proof vols-is-max-is-min-eraseq (
previous step
)
⊦ 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)
Lemma
in-eraseq-strong-valid