law find2_pair_t
lawful-bytes@0.1.1.0 · proof_find.bend:178
import lawful-bytes@0.1.1.0/proof_find.bend as ProofFind
import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-bytes@0.1.1.0/bytes.bend as B
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-arrays@0.1.0.0/proof_tree.bend as P
178law find2_pair_t:
179 for +len: U32
180 for +t: P.Tree<U32>
181 for +from: U32
182 for +to: U32
183 for +c1: U32
184 for +c2: U32
185 {B.find2(C.BT(len, t), from, to, c1, c2) == (C.BT(len, t), Pair.snd(D.Bytes, U32, B.find2(C.BT(len, t), from, to, c1, c2))) : D.Bytes & U32}