[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 14 from proof delta-erase-worker-helper (
previous step
)
⊦ n < # wlar ∧ wlar[n].ec < ecs(wlar).max ∧ m ≤ ecs(wlar).max → Δ wlar[n, wl-entry(m, stat)] = (Δ wlar - (ecs(wlar).max - wlar[n].ec)) + (ecs(wlar).max - m)
A spec-lemma