[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 rowsorted-smallercol-evnbounded
srowsorted(mx, #r mx, mx), c0 < #c mx, c < #c mx, c < c0, m ≤ n, n ≤ #r mx ⊦ count(mx[c]c, m, n, λ j. j < i) ≥ countevn(mx[c0]c, m, n, λ j. j < i)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
max0column-countcol-small-even
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 17
Used lemmas:
srowsorted-def
,
countevn-rec
,
countevn-base
,
Used spec theorems:
filter-count
/oarray-sort/
countrange-rec
olist
/oarray-sort/
orderedle-all
Used simplifier rules:
nat
/
lez-01
nat
/
ge
nat
/
le-def
nat-basic
/
f
nat-basic
/
lf
nat-basic
/
trans-nat
matrix+array
/
selcol-size
nat
/
lez
nat-basic
/
succ
nat-basic
/
c
nat-basic
/
a
nat
/
le-one
nat
/
succ-01
nat
/
lels-03
nat
/
les
nat
/
eqle-one
nat-basic
/
lf-01
nat
/
fle
nat-basic
/
oz
nat
/
lep-02
nat-basic
/
s-04
nat-basic
/
refl-nat
filter-count
/oarray-sort/
countrange-base
nat
/
lels
nat
/
ls-le-simp
nat
/
fle-01
matrix+array
/
selcol-get
nat-basic
/
add-base
nat-basic
/
l-02
nat
/
ls-add-not-01
nat
/
ler
nat
/
anti
nat-basic
/
l-01
list-perm
/oarray-sort/
ref
matrix+array
/
selrow-get
matrix+array
/
selrow-size
oelem
/
nll
oelem
/
nnn