sortedperm-count-splitsperm(a0, a), ordered≤(a), # a0 = # a, n < # a ⊦ a[n] < i ↔ n < count(a0, λ j. j < i)
24sortedperm-count-splits-proofsortedperm-count-splits-proof-info
The proof is valid.
colsorted-clean0notlscolsorted-count-below-clean0rowsmax0column-clean0rowsboundedmax0column-determines-clean1rows
../../../../../../lib/polybasic/specs/olist-min-max/export/unit.xmlolist-min-maxoarray-sort../../../../../../lib/polybasic/specs/olist-min-max/export/ordered-count-splits/longlemmainfo.xmlordered-count-splits../../../../../../lib/polybasic/specs/filter-count/export/unit.xmlfilter-countoarray-sort../../../../../../lib/polybasic/specs/filter-count/export/perm-count/longlemmainfo.xmlperm-count../../../../../../lib/polybasic/specs/list-data/export/unit.xmllist-dataoarray-sort../../../../../../lib/polybasic/specs/list-data/export/l/longlemmainfo.xmll../../../../../../lib/basic/specs/nat-basic/export/unit.xmlnat-basic../../../../../../lib/basic/specs/nat-basic/export/lf-01/longlemmainfo.xmllf-01../../../../../../lib/basic/specs/nat-basic/export/unit.xmlnat-basic../../../../../../lib/basic/specs/nat-basic/export/f/longlemmainfo.xmlf