[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 maximum-sum-bounds
⊦ maximum-sum(ar, n, m, i) ↔ n + m ≤ # ar ∧ i = sum(ar, n, m) ∧ upper-bound(ar, i)
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
max-sum-empty-array
,
max-sum-keep-current-max
,
max-sum-new-current-max
,
max-sum-next-less-zero
,
Used by units in proved state:
Proof exists?: No