[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
,
Theorem ecs-n-write
⊦ n ≤ # wlar → ecs(wlar[m, wle], n) = (m < n ⊃ (ecs(wlar, n) -- wlar[m].ec) ++ wle.ec;ecs(wlar, n))
Type: A user defined theorem
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
ecs-write
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 37
Used lemmas:
in-ecs-n
,
ecs-n-rec
,
ecs-n-base
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
zero-01
bag-union
/nat-bag/
del-rec
nat
/
succ-01
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat
/
fle-01
wlentry
/
elim-02
nat
/
lels
nat
/
ls-le-simp
oelem
/nat-set/
irreflexivity
bag-max
/
bag-remadd-in
array
/wlarray-base/
Put-same
nat
/
ler
bag-basic
/nat-bag/
bag-add2-eq-elim
nat-basic
/
succ
wlentry
/
inj-03
nat-basic
/
lf
nat
/
lels-02
array
/wlarray-base/
Put-other
bag-basic
/nat-bag/
insert-inj
wlentry
/
sel-05
nat-basic
/
f
array
/wlarray-base/
Size-put
array
/wlarray-base/
ngp-07
nat
/
lels-03
nat-basic
/
ls-02