[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 1 from proof valid-eraseqw-update-ec (conclusion)
⊦ wlar[m] = wl-entry(m0, stat) → (valid-eraseq(wlar[m, wl-entry(m1, stat)], q) ↔ valid-eraseq(wlar, q))
System applied rule normalize
And obtained the following new goals
Proof step 2
:
wlar[m] = wl-entry(m0, stat) ⊦ valid-eraseq(wlar[m, wl-entry(m1, stat)], q) ↔ valid-eraseq(wlar, q)
Rule argument
Additional information