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