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