law fg_eq

lawful-bytes@0.1.1.0 · proof_fast_find.bend:33

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

33law fg_eq:
34  for +n: Nat
35  for +z: Bool
36  for +wi: U32
37  for +m: U32
38  for +rc: U32
39  for +t: P.Tree<U32>
40  {FA.find.go(n, z, Array.get(U32, P.fromT(U32, t), (wi + 1 : U32)), wi, m, rc) == (P.fromT(U32, t), FG(n, z, wi, m, rc, t)) : Array<U32> & U32}