[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 in-ecs (conclusion)
⊦ n < # wlar ∧ wlar[n] = wl-entry(m, stat) → m ∈ ecs(wlar)
System applied rule normalize
And obtained the following new goals
Proof step 2
:
wlar[n] = wl-entry(m, stat), n < # wlar ⊦ m ∈ ecs(wlar)
Rule argument
Additional information