MlbendSplit.split_covers: law of mlbend-split@0.1.1.0
Import: import mlbend-split@0.1.1.0/main.bend as MlbendSplit
Lines 29-38 of mlbend-split@0.1.1.0/main.bend: https://jend.leeeet.dev/read.txt?path=mlbend-split@0.1.1.0/main.bend&start_line=29&end_line=38

import Base

# LAW (split_covers): every row of the dataset is placed in a fold — the
# fold list holds one entry per row, so the folds are a partition of the
# rows: the test rows of a fold and its training rows are disjoint, and
# together they hold every row.
law split_covers:
  for labels: List<&2, Nat>
  for +orders: List<&2, List<&2, Nat>>
  for +k: Nat
  for +i: Nat
  {count_rows(folds_from(labels, orders, k, i)) == List.length(&2, Nat, labels) : Nat}

Uses (6):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.length
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.add
  https://jend.leeeet.dev/definition.txt?path=mlbend-split@0.1.1.0/main.bend&name=count_rows
  https://jend.leeeet.dev/definition.txt?path=mlbend-split@0.1.1.0/main.bend&name=folds_from