[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 count-add-even-odd-ind
m ≤ n, n ≤ # a ⊦ countevn(a, m, n, p) + countodd(a, m, n, p) = count(a, m, n, p)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
colsort-dirtyboundhalf
,
count-add-even-odd
,
max0column-clean0rowsbounded
,
max0column-countcol-big-odd
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 16
Used lemmas:
countodd-rec
,
countevn-rec
,
countodd-base
,
countevn-base
,
Used spec theorems:
Used simplifier rules:
nat
/
lez-01
nat-basic
/
a
nat-basic
/
c
nat
/
lez
filter-count
/oarray-sort/
countrange-base
list-data
/oarray-sort/
l
nat-basic
/
f
nat
/
le-one
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
filter-count
/oarray-sort/
countrange-rec
nat-basic
/
eq-01
nat-even
/
eo
nat-basic
/
add-base
nat-even
/
oe-01
nat-even
/
Odd