[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 ecs-empty (conclusion)
⊦ ecs(wlar) = ∅ ↔ # wlar = 0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 2
:
⊦ ecs(wlar) = ecs(wlar, # wlar)
Proof step 3
:
⊦ ecs(wlar, # wlar) = ∅ ↔ # wlar = 0
Rule argument
spec: <toplevel> name: ecs seq: ⊦ ecs(wlar) = ecs(wlar, # wlar) subst: [wlar] → [wlar] flags: <all paths>
Additional information
Used terms: wlar