[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 delta-write
⊦ n < # wlar ∧ wlar[n].ec < ecs(wlar).max ∧ m ≤ ecs(wlar).max → Δ wlar[n, wl-entry(m, stat)] = (Δ wlar - (ecs(wlar).max - wlar[n].ec)) + (ecs(wlar).max - m)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
ubi-quality
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 23
Used lemmas:
in-ecs
,
sum-of-differences-rem
,
ecs-empty
,
bag-rem-eq-empty-elim
,
sum-of-differences-base
,
sum-of-differences-rec
,
ecs-write
,
delta-01
,
Used spec theorems:
ubi-asm
/
ls-max
bag-max
/
bag-rem-notmax
Used simplifier rules:
nat
/
le-ls-simp
nat
/
elim-sub
nat
/
lels-03
wlentry
/
elim-02
nat-basic
/
l-01
wlentry
/
sel-05
nat
/
gr-def
nat
/
le-def
oelem
/nat-set/
irreflexivity
nat
/
eq-02
bag-max
/
max-one
nat-basic
/
f
nat
/
prop-07
nat-basic
/
lf-01
nat
/
lels
nat-basic
/
add-base
nat
/
zero
nat
/
let
nat-basic
/
eq-02
nat-basic
/
a
nat-basic
/
c
nat
/
anti
nat
/
lep-02
nat
/
ler
nat
/
eq-01
nat-basic
/
eq-01