[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 15 from proof coef-le-2pot (
previous step
)
∃ i1, j1. i0 ≤ i1 ∧ i1 ≤ j0 ∧ intfun(i1) = i ∧ i0 ≤ j1 ∧ j1 ≤ j0 ∧ intfun(j1) = j ∧ i1 ≠ j1, ∀ i1. i0 ≤ i1 ∧ i1 ≤ j0 → 0 ≤ intfun(i1), 0 ≤ i0 ⊦ ¬ Σ countFun(i0, j0, intfun) < i + j
A spec-lemma