law s1_pair

lawful-bytes@0.1.1.0 · proof_same.bend:585

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

585law s1_pair:
586  for +n: Nat
587  for +len: U32
588  for +t: P.Tree<U32>
589  for +i: U32
590  for +j: U32
591  for +acc: Bool
592  {B.same1.go(n, B.at2(C.BT(len, t), i, j), i, j, acc) == (C.BT(len, t), Pair.snd(D.Bytes, Bool, B.same1.go(n, B.at2(C.BT(len, t), i, j), i, j, acc))) : D.Bytes & Bool}