law shift_go_eq
lawful-bytes@0.1.1.0 · proof_shift.bend:128
import lawful-bytes@0.1.1.0/proof_shift.bend as ProofShift
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
128law shift_go_eq:
129 for +m: Nat
130 for +len: U32
131 for +tb: P.Tree<U32>
132 for +j: U32
133 for +p: U32
134 for +k: U32
135 {B.shift.go(m, B.at(C.BT(len, tb), p), j, k) == C.BT(len, SGT(len, m, tb, j, p, k)) : D.Bytes}