rowperms-clean0unchanged#r mx = #r mx0, #c mx = #c mx0, #c mx ≠ 0, ∀ r. r < #r mx → perm(mx0[r]r, mx[r]r)
⊦ #clean0rows(mx0, i) = #clean0rows(mx, i) ↔ trueclean0rows-alllsclean0rows-notalllsclean0rows-bounded
817rowperms-clean0unchanged-proofrowperms-clean0unchanged-proof-info
The proof is valid.
rowperms-dirtyrowsunchanged
sorting rows leaves number of clean0 rows for i unchanged../../../../../../lib/basic/specs/filter-count/export/unit.xmlfilter-countoarray-sort../../../../../../lib/basic/specs/filter-count/export/perm-count/longlemmainfo.xmlperm-count../../../../../../lib/basic/specs/list-perm/export/unit.xmllist-permoarray-sort../../../../../../lib/basic/specs/list-perm/export/sym/longlemmainfo.xmlsym../../../../../../lib/basic/specs/nat-basic/export/unit.xmlnat-basic../../../../../../lib/basic/specs/nat-basic/export/f/longlemmainfo.xmlf../../../../../../lib/basic/specs/nat-basic/export/unit.xmlnat-basic../../../../../../lib/basic/specs/nat-basic/export/lf-01/longlemmainfo.xmllf-01../../../../../../lib/basic/specs/nat/export/unit.xmlnat../../../../../../lib/basic/specs/nat/export/fle/longlemmainfo.xmlfle../../../../../../lib/basic/specs/nat/export/unit.xmlnat../../../../../../lib/basic/specs/nat/export/lels/longlemmainfo.xmllels../../../../../../lib/basic/specs/nat-basic/export/unit.xmlnat-basic../../../../../../lib/basic/specs/nat-basic/export/neq-01/longlemmainfo.xmlneq-01