law find_pair_t
lawful-bytes@0.1.1.0 · proof_find.bend:135
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
135law find_pair_t:
136 for +len: U32
137 for +t: P.Tree<U32>
138 for +from: U32
139 for +to: U32
140 for +c: U32
141 {B.find(C.BT(len, t), from, to, c) == (C.BT(len, t), Pair.snd(D.Bytes, U32, B.find(C.BT(len, t), from, to, c))) : D.Bytes & U32}