law fgo2_pair

lawful-bytes@0.1.1.0 · proof_find.bend:153

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

153law fgo2_pair:
154  for n: Nat
155  for +hit: Bool
156  for +len: U32
157  for +t: P.Tree<U32>
158  for +x: U32
159  for +j: U32
160  for +to: U32
161  for +c1: U32
162  for +c2: U32
163  {B.find2.go(n, hit, (C.BT(len, t), x), j, to, c1, c2) == (C.BT(len, t), Pair.snd(D.Bytes, U32, B.find2.go(n, hit, (C.BT(len, t), x), j, to, c1, c2))) : D.Bytes & U32}