[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-maxcol0-bounded
c0 < #c mx0 ⊦ countevn(mx0[c0]c, #clean0rows(mx0, i), #r mx0, λ j. j < i) ≤ #dirtyrows(mx0, i) /↑ 2
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
scolsort-dirtyboundhalf
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 20
Proof steps: 46
Used lemmas:
divup-def
,
countevn-bounded-ind
,
clean1rows-allge
,
countevn-zero-ind
,
clean0-plus-clean1-bounded
,
clean1rows-bounded
,
countevn-append-ind
,
dirtyrows-def
,
Used spec theorems:
filter-count
/oarray-sort/
count-zero
nat-mult
/
mult-c
nat-mult
/
zero-02
nat-mult
/
eq
Used simplifier rules:
nat-basic
/
f
nat
/
le-def
nat
/
ls-02
nat
/
ls-03
nat
/
lep
matrix+array
/
selcol-size
nat
/
ler
nat-basic
/
a
nat-basic
/
c
nat-basic
/
l-01
nat
/
fle
nat-basic
/
lf-01
nat
/
fle-01
nat
/
lep-02
nat
/
let
matrix+array
/
selcol-get
matrix+array
/
selrow-get
matrix+array
/
selrow-size
nat-basic
/
add-base
nat
/
elim-sub
nat-basic
/
eqs
nat-basic
/
lf-02
nat-basic
/
l
nat-basic
/
l-02
nat
/
eq-01
nat-basic
/
one-06
nat-basic
/
oz
nat-div
/
two-zero-01-01
nat-div
/
le-div-to-mult
nat-div
/
div-elim
nat-mult
/
modeq
nat-mult
/
two-zero-01
nat-div
/
two-mdiv2-02
nat-mult
/
le2-04
nat
/
ls-le-simp
nat-mult
/
mult-a
nat-mult
/
mult-c
nat-basic
/
eq-01
nat-basic
/
succ
nat
/
l-num-05
nat-basic
/
one-01
nat-mult
/
modeq-01
nat-basic
/
l-05
nat-mult
/
le-num
nat-basic
/
z-01
nat
/
lels
nat-basic
/
s-04
nat
/
add-num-01
nat-mult
/
rsucc-02
nat-basic
/
ls-02
nat-even
/
eo-01
nat-mult
/
two-one-01
nat-basic
/
refl-nat