law min_run

lawful-bytes@0.1.1.0 · proof_fast_find2.bend:132

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-bytes@0.1.1.0/proof_fast_find.bend as FF

132# The first c1 or c2 is the earlier of the first c1 and the first c2.
133law min_run:
134  for +xs: List<&2, U32>
135  for +c1: U32
136  for +c2: U32
137  for +b1: Bool
138  for +b2: Bool
139  for +hb1: {FF.hd_eq(xs, c1) == b1 : Bool}
140  for +hb2: {FF.hd_eq(xs, c2) == b2 : Bool}
141  {Nat.min(D.run_len(xs, c1), D.run_len(xs, c2)) == D.run_len2(xs, c1, c2) : Nat}