[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 count0-leq-clean0-ind
c < #c mx ⊦ m ≤ #clean0rows(mx, i) → count(mx[c]c, 0, m, λ j. j < i) = m
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
count0-leq-clean0
,
max0column-clean0rowsbounded
,
scolsorted-clean0notls
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 14
Used lemmas:
clean0rows-allls
,
clean0rows-bounded
,
Used spec theorems:
filter-count
/oarray-sort/
count-zero
Used simplifier rules:
matrix+array
/
selcol-size
nat
/
lez
filter-count
/oarray-sort/
countrange-base
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat
/
succ-01
nat-basic
/
succ
matrix+array
/
selcol-get
filter-count
/oarray-sort/
countrange-rec
nat-basic
/
trans-nat
nat-basic
/
lf
nat
/
le-def
nat-basic
/
eq-01
nat
/
lels-03
nat-basic
/
add-base
nat
/
fle
nat
/
lels
matrix+array
/
selrow-get
matrix+array
/
selrow-size