[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-zero-ind
∀ r. m ≤ r ∧ r < n ∧ even(r) → ¬ p(a[r]), m ≤ n, n ≤ # a ⊦ countevn(a, m, n, p) = 0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
countevn-maxcol0-bounded
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 12
Used lemmas:
countevn-rec
,
countevn-base
,
Used spec theorems:
Used simplifier rules:
nat
/
lez-01
nat-basic
/
less-zero
nat
/
lez
list-data
/oarray-sort/
l
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat
/
le-one
nat-basic
/
s-04
nat-basic
/
succ
nat
/
succ-01
nat
/
lels-03
nat
/
le-def
nat
/
les
nat
/
eqle-one
nat-basic
/
lf-01
nat
/
fle
nat-basic
/
oz
nat
/
lels
nat
/
ls-le-simp
nat
/
fle-01
nat-basic
/
z-01
nat-basic
/
refl-nat
nat-basic
/
lf
nat-basic
/
trans-nat
nat-basic
/
ls-02