[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 clean0rows-allls
⊦ r < #clean0rows(mx, i) → count(mx[r]r, λ j. ¬ j < i) = 0
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
clean0-plus-clean1-bounded
,
colsorted-samecount-above-clean0
,
count0-leq-clean0-ind
,
dirytrows-leone
,
dirytrows-zero
,
rowperms-clean0unchanged
,
Used by units in proved state:
Proof exists?: No