[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 3 from proof countFun-last (
previous step
)
j = i0 + 1, i ≤ j ⊦ countFun(i, j, intfun) = countFun(i, i0, intfun) + intfun(j) '
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 4
:
i ≤ i0 + 1 ⊦ countFun(i, i0 + 1, intfun) = countFun(i, i0, intfun) + intfun(i0 + 1) '
Rule argument
Additional information