law set_eq_t

lawful-bytes@0.1.1.0 · proof_ops.bend:71

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-words@0.1.0.0/defs.bend as W
import lawful-arrays@0.1.0.0/proof_tree.bend as P
import lawful-arrays@0.1.0.0/proof_index.bend as I

71law set_eq_t:
72  for +len: U32
73  for +t: P.Tree<U32>
74  for +i: U32
75  for +v: U32
76  {B.set(C.BT(len, t), i, v) == C.BT(len, I.set_tree(U32, t, (i >> 2n : U32), W.put_byte(C.WD(t, (i >> 2n : U32)), U32.to_nat((i .&. 3 : U32)), v))) : D.Bytes}