law sm_pair

lawful-bytes@0.1.1.0 · proof_same.bend:455

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

455law sm_pair:
456  for +n: Nat
457  for +la: U32
458  for +ta: P.Tree<U32>
459  for +lb: U32
460  for +tb: P.Tree<U32>
461  for +i: U32
462  for +j: U32
463  for +acc: Bool
464  {B.same.go(n, B.at(C.BT(la, ta), i), B.at(C.BT(lb, tb), j), i, j, acc) == (C.BT(la, ta), (C.BT(lb, tb),
465    Pair.snd(D.Bytes, Bool, Pair.snd(D.Bytes, D.Bytes & Bool, B.same.go(n, B.at(C.BT(la, ta), i), B.at(C.BT(lb, tb), j), i, j, acc))))) : D.Bytes & (D.Bytes & Bool)}