law tl_pair

lawful-bytes@0.1.1.0 · proof_same.bend:162

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

162law tl_pair:
163  for +n: Nat
164  for +len: U32
165  for +t: P.Tree<U32>
166  for +j: U32
167  for +acc: List<&2, U32>
168  {B.to_list.go(n, B.at(C.BT(len, t), j), j, acc) == (C.BT(len, t), Pair.snd(D.Bytes, List<&2, U32>, B.to_list.go(n, B.at(C.BT(len, t), j), j, acc))) : D.Bytes & List<&2, U32>}