law digits_pair_t
lawful-fields@0.1.1.0 · proof_digits.bend:160
import lawful-fields@0.1.1.0/proof_digits.bend as ProofDigits
import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-fields@0.1.1.0/fields.bend as FC
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-arrays@0.1.0.0/proof_tree.bend as P
160law digits_pair_t:
161 for +len: U32
162 for +t: P.Tree<U32>
163 for +from: U32
164 for +to: U32
165 {FC.digits(C.BT(len, t), from, to) == (C.BT(len, t), Pair.snd(D.Bytes, Bool, FC.digits(C.BT(len, t), from, to))) : D.Bytes & Bool}