law run_hit2

lawful-bytes@0.1.1.0 · proof_fast_find2.bend:211

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

211law run_hit2:
212  for +xs: List<&2, U32>
213  for +ys: List<&2, U32>
214  for +n: Nat
215  for +c1: U32
216  for +c2: U32
217  for +b: Bool
218  for +hb: {hd2(xs, c1, c2) == b : Bool}
219  for +h: {Nat.is_lt(D.run_len2(xs, c1, c2), List.length(&2, U32, xs)) == True{} : Bool}
220  {D.run_len2(List.take(&2, U32, List.append(&2, U32, xs, ys), n), c1, c2) == Nat.min(D.run_len2(xs, c1, c2), n) : Nat}