~/jendhub

law to_nat_shln_mod.m

lawful-words@0.1.0.0 · proof_u32.bend:1111

import lawful-words@0.1.0.0/proof_u32.bend as ProofU32
import Base

1111law to_nat_shln_mod.m:
1112  for +a: U32
1113  for +k: Nat
1114  for +m: Nat
1115  for +hm: {Nat.pow(2n, 32n) == m : Nat}
1116  {Nat.mod(U32.to_nat(U32.shln(a, k)), Nat.pow(2n, k)) == 0n : Nat}

Uses (11)

Used by (1)