law to_nat_shln_mod

lawful-words@0.1.0.0 · proof_u32.bend:1123

import Base

1123law to_nat_shln_mod:
1124  for +a: U32
1125  for +k: Nat
1126  {Nat.mod(U32.to_nat(U32.shln(a, k)), Nat.pow(2n, k)) == 0n : Nat}