[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 10 from proof ecs-write (
previous step
)
wlar[m] = wl-entry(m0, stat), m < # wlar ⊦ ecs(wlar, # wlar) -- m0 = ecs(wlar) -- m0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 11
:
⊦ ecs(wlar) = ecs(wlar, # wlar)
Rule argument
spec: <toplevel> name: ecs seq: ⊦ ecs(wlar) = ecs(wlar, # wlar) subst: [wlar] → [wlar] flags: <all paths>
Additional information
Used terms: wlar