[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 countrefs_more_gr0
⊦ # ints > 1 ∧ ints .first > 0 → countrefs2(ints) = ints .first + ints .first * countrefs2(ints .rest)
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
countmore2
,
countrefs2
,
countrefs2-01
,
countrefs2-02
,
countrefs2-pos
,
countrefs2-two
,
Used by units in proved state:
Proof exists?: No