[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 countodd-bounded-ind
m ≤ n, n ≤ # a ⊦ countodd(a, m, n, p) ≤ (odd(m) ⊃ (n + 1 - m) / 2;(n - m) / 2)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
countodd-maxcol0-bounded
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 26
Proof steps: 65
Used lemmas:
countodd-rec
,
countodd-base
,
Used spec theorems:
nat-even
/
odd-add
nat-mult
/
eq
nat-even
/
Even
Used simplifier rules:
nat-basic
/
f
nat
/
let
nat
/
le-def
nat-basic
/
c
nat-basic
/
a
nat
/
add-01
nat
/
lez-01
nat
/
lez
list-data
/oarray-sort/
l
nat-basic
/
succ
nat
/
succ-01
nat
/
lels-03
nat
/
elim-sub
nat
/
lep
nat
/
eqle-one
nat-div
/
div-elim
nat
/
fle
nat
/
le-add
nat-basic
/
add-base
nat
/
lels
nat
/
ls-le-simp
nat-basic
/
less-zero
nat-basic
/
eq-01
nat-even
/
oe-01
nat-basic
/
s-04
nat-mult
/
rsucc-02
nat-mult
/
modeq-01
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic
/
z-01
nat-mult
/
coef-17
nat-basic
/
one-01
nat
/
l-num-05
nat-basic
/
oz
nat-basic
/
l-02
nat-even
/
meven-02
nat-even
/
modd-03
nat
/
ls-add-not-01
nat
/
add-num-01
nat
/
ler
nat
/
anti
nat-mult
/
two-02
nat-even
/
eo
nat-even
/
Odd
nat-mult
/
two-zero-01
nat-basic
/
lf-02
nat-basic
/
zero
nat-basic
/
lf-01
nat-basic
/
l-01
nat
/
fle-01
nat-mult
/
modeq
nat-even
/
plus
nat-even
/
oe-02
nat-basic
/
l
nat-basic
/
trans-nat
nat-basic
/
lf
nat
/
eq
nat-basic
/
l-05