law fg2_eq
lawful-bytes@0.1.1.0 · proof_fast_find2.bend:41
import lawful-bytes@0.1.1.0/proof_fast_find2.bend as ProofFastFind2
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
41law fg2_eq:
42 for +n: Nat
43 for +z: Bool
44 for +wi: U32
45 for +m: U32
46 for +r1: U32
47 for +r2: U32
48 for +t: P.Tree<U32>
49 {FA.find2.go(n, z, Array.get(U32, P.fromT(U32, t), (wi + 1 : U32)), wi, m, r1, r2) == (P.fromT(U32, t), FG2(n, z, wi, m, r1, r2, t)) : Array<U32> & U32}