[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 countFun-rec
⊦ i ≤ j → countFun(i, j, intfun) = intfun(i) ' + countFun(i + 1, j, intfun)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
countFun-dist
,
countFun-in
,
countFun-last
,
countFun-last-01
,
countFun-length
,
countFun-mult
,
countFun-one
,
Used by units in proved state:
int-mod
,
int-fac
,
Proof exists?: No