law nohit_run

lawful-bytes@0.1.1.0 · proof_fast_find.bend:570

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-bytes@0.1.1.0/fast.bend as FA
import lawful-bytes@0.1.1.0/proof_fast_word.bend as FW
import lawful-arrays@0.1.0.0/proof_tree.bend as P

570# An unflagged word has no c from the start on.
571law nohit_run:
572  for +t: P.Tree<U32>
573  for +wi: U32
574  for +o: Nat
575  for +v: U32
576  for +c: U32
577  for +hv: {FW.P0(v) == Nat.add(o, D.run_len(AW(t, wi, o), c)) : Nat}
578  for +hz: {U32.is_zero(FA.zb(v)) == True{} : Bool}
579  {D.run_len(AW(t, wi, o), c) == List.length(&2, U32, AW(t, wi, o)) : Nat}