law to_nat_shln_fits_p

lawful-words@0.1.0.0 · proof_u32.bend:1078

import Base

1078law to_nat_shln_fits_p:
1079  for +a: U32
1080  for +k: Nat
1081  for +h: {Nat.is_lt(Nat.mul(U32.to_nat(a), Nat.pow(2n, k)), Nat.pow(2n, 32n)) == True{} : Bool}
1082  {U32.to_nat(U32.shln(a, k)) == Nat.mul(U32.to_nat(a), Nat.pow(2n, k)) : Nat}