[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
c < #c mx ⊦ #clean0rows(mx, i) ≤ count(mx[c]c, λ j. j < i)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
colsorted-clean0notls
,
colsorted-count-below-clean0rows
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
clean0rows-bounded
,
count0-leq-clean0-ind
,
Used spec theorems:
filter-count
/oarray-sort/
count-def
filter-count
/oarray-sort/
count-append-ind
Used simplifier rules:
nat-basic
/
f
nat
/
le-def
nat-basic
/
lf-01
nat
/
ler
matrix+array
/
selcol-size
nat
/
lez
nat
/
fle
nat-basic
/
l-02
nat-basic
/
a
nat-basic
/
c