law fgo_pair

lawful-bytes@0.1.1.0 · proof_find.bend:111

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

111law fgo_pair:
112  for n: Nat
113  for +hit: Bool
114  for +len: U32
115  for +t: P.Tree<U32>
116  for +x: U32
117  for +j: U32
118  for +to: U32
119  for +c: U32
120  {B.find.go(n, hit, (C.BT(len, t), x), j, to, c) == (C.BT(len, t), Pair.snd(D.Bytes, U32, B.find.go(n, hit, (C.BT(len, t), x), j, to, c))) : D.Bytes & U32}