[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-n-write (conclusion)
⊦ n ≤ # wlar → ecs(wlar[m, wle], n) = (m < n ⊃ (ecs(wlar, n) -- wlar[m].ec) ++ wle.ec;ecs(wlar, n))
System applied rule normalize
And obtained the following new goals
Proof step 2
:
n ≤ # wlar ⊦ ecs(wlar[m, wle], n) = (m < n ⊃ (ecs(wlar, n) -- wlar[m].ec) ++ wle.ec;ecs(wlar, n))
Rule argument
Additional information