[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 5 from proof valid-eraseqp-in0 (
previous step
)
⊦ n ∈ q ∧ valid-eraseq(wlar, q) ∧ wlar[n] = wl-entry(m, stat) → wlar[n] = wl-entry(m, erasing)
Lemma
valid-eraseqp-in