[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 counti2j-rec
⊦ i ≤ j → count-i2j(i, j) = count-i2j(i, j - 1) + j
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
coprimes-prime
,
count-i2j-empty-02
,
count-i2j-in
,
count-i2j-no-dups
,
count-one
,
count-rec
,
Used by units in proved state:
Proof exists?: No