[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 119 from proof inv-recover (
previous step
)
⊦ valid-eraseq(wlar, q) ∧ (∀ wle. f(wle).status = wle.status) ∧ valid-indices(wlar, nx) ∧ ¬ dups(nx) → valid-eraseq(wlar.mapIndices(nx, f), q)
A spec-lemma