[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 7 from proof max-sum-empty-array (
previous step
)
⊦ upper-bound(ar, i) ↔ (∀ n, m. n + m ≤ # ar → sum(ar, n, m) ≤ i)
Lemma
upper-bound