[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 countevn-rec
m ≤ n, n ≤ # a ⊦ countevn(a, m, n + 1, p) = countevn(a, m, n, p) + (even(n) ∧ p(a[n]) ⊃ 1;0)
Type: An axiom
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
count-add-even-odd-ind
,
countevn-append-ind
,
countevn-bounded-ind
,
countevn-zero-ind
,
fullcountevn-range
,
rowsorted-smallercol-evnbounded
,
Used by units in proved state:
Proof exists?: No