[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 max-sum-keep-current-max
n < # ar ⊦ j + ar[n] ≤ i ∧ maximum-suffix-sum(subarray(ar, 0, n), m, j) ∧ maximum-sum(subarray(ar, 0, n), i) → maximum-sum(subarray(ar, 0, n + 1), i)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
kadane
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 18
Used lemmas:
sum-succ
,
upper-bound
,
sum-zero
,
suffix-upper-bound
,
upper-bound-reduce
,
maximum-suffix-sum
,
sum-subarray
,
maximum-sum-bounds
,
maximum-sum
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
ref
nat-basic
/
s-04
nat-basic
/
oz
nat-basic
/
lf-01
nat
/
les
int-abs
/
le-def
nat-basic
/
trans
nat
/
fle
nat-basic
/
lf
nat
/
ler
nat
/
lep-02
nat
/
le
nat
/
le-ls-simp
int-abs
/
zero-gels-01
nat
/
succ-01
int-abs
/
forward-le-02
nat
/
eqle-one
nat
/
eq
nat
/
lels-03
array-copy
/int-array/
size-subarray
nat-basic
/
add-base
nat
/
le-one
nat
/
le-add
nat-basic
/
l-02
nat
/
fle-01
nat-basic
/
f
nat
/
le-def
int-basic2
/
ls-01
nat
/
ls-le-simp
nat
/
lels
nat-basic
/
succ
nat-basic
/
lf-02
int-abs
/
forward-lels
nat-basic
/
eq-01
nat-basic
/
a
nat-basic
/
c
int-basic2
/
ls-add-both
int-basic2
/
add-a
int-basic2
/
add-c
nat
/
lep
int-abs
/
lels-03
nat
/
elim-sub