law shift_ok_t

lawful-bytes@0.1.1.0 · proof_shift.bend:498

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

498law shift_ok_t:
499  for +len: U32
500  for +t: P.Tree<U32>
501  for +d: Nat
502  for +k: U32
503  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
504  for +hk: {Nat.is_le(U32.to_nat(k), D.size(C.BT(len, t))) == True{} : Bool}
505  {D.ok(B.shift(C.BT(len, t), k), d) == True{} : Bool}