law nohit2

lawful-bytes@0.1.1.0 · proof_fast_find2.bend:377

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-bytes@0.1.1.0/proof_fast_find.bend as FF
import lawful-arrays@0.1.0.0/proof_tree.bend as P

377law nohit2:
378  for +t: P.Tree<U32>
379  for +wi: U32
380  for +o: Nat
381  for +v1: U32
382  for +v2: U32
383  for +c1: U32
384  for +c2: U32
385  for +hv: {Nat.min(FW.P0(v1), FW.P0(v2)) == Nat.add(o, D.run_len2(FF.AW(t, wi, o), c1, c2)) : Nat}
386  for +hz: {U32.is_zero(U32.or(FA.zb(v1), FA.zb(v2))) == True{} : Bool}
387  {D.run_len2(FF.AW(t, wi, o), c1, c2) == List.length(&2, U32, FF.AW(t, wi, o)) : Nat}