[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 16 from proof valid-eraseq-next-erasing (
previous step
)
wlar[n] = wl-entry(m1, erasing), n < # wlar, n < m, m < # wlar, n + 1 < # wlar, ∀ n. n ∈ q ↔ n < m ∧ wlar[n].status = erasing ⊦ n = m, n ∈ q, m ∈ q
Heuristic quantifier applied rule all left
And closed the goal!
Rule argument
pos: left 6 terms: n
Additional information
Used simplifier rules: ⊦ wl-entry(m, stat).status = stat; (s) Used terms: n