law num_pair_t

lawful-fields@0.1.1.0 · proof_num.bend:482

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-fields@0.1.1.0/fields.bend as C
import lawful-bytes@0.1.1.0/proof_core.bend as K
import lawful-arrays@0.1.0.0/proof_tree.bend as P

482law num_pair_t:
483  for +len: U32
484  for +t: P.Tree<U32>
485  for +from: U32
486  for +to: U32
487  {C.num(K.BT(len, t), from, to) == (K.BT(len, t), Pair.snd(D.Bytes, Maybe<&2, U32>, C.num(K.BT(len, t), from, to))) : D.Bytes & Maybe<&2, U32>}