[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 max0column-determines-clean1rows
c0 < #c mx, ∀ c. c < #c mx → ordered≤(mx[c]c), ∀ c. c < #c mx → count(mx[c]c, λ j. j < i) ≤ count(mx[c0]c, λ j. j < i) ⊦ #clean1rows(mx, i) + count(mx[c0]c, λ j. j < i) = #r mx
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: 13
Proof steps: 33
Used lemmas:
clean1rows-allge
,
sortedperm-count-splits
,
clean1rows-notallge
,
clean1rows-bounded
,
Used spec theorems:
filter-count
/oarray-sort/
count-zero
filter-count
/oarray-sort/
count-bounded
Used simplifier rules:
nat-basic
/
f
nat
/
lels
nat-basic
/
c
nat-basic
/
a
nat
/
eq-02
nat-basic
/
l-02
nat-basic
/
lf-01
nat
/
anti
nat
/
succ-01
nat
/
fle
nat-basic
/
eq-02
nat-basic
/
l-05
nat
/
elim-sub
nat-basic
/
s-04
nat-basic
/
l
nat
/
lels-03
matrix+array
/
selrow-size
matrix+array
/
selrow-get
nat
/
let
matrix+array
/
selcol-get
nat
/
le-ls-simp
matrix+array
/
selcol-size
list-perm
/oarray-sort/
ref
nat-basic
/
eq-01
nat-basic
/
l-01
nat
/
fle-01
nat-basic
/
neq-01
nat
/
gr-def
nat-basic
/
ls-02
nat
/
ls-01
nat-basic
/
one-01
nat
/
le-def
nat
/
elim-pred-c
nat
/
lep
nat-basic
/
oz
nat
/
not-zero
nat
/
eqle-one
nat
/
lep-02
nat-basic
/
nls-fst
nat-basic
/
add-base
nat
/
add-01
nat-basic
/
refl-nat