law to_nat_or_split

lawful-words@0.1.0.0 · proof_u32.bend:1193

import Base

1193law to_nat_or_split:
1194  for +a: U32
1195  for +b: U32
1196  for +k: Nat
1197  for +ha: {Nat.mod(U32.to_nat(a), Nat.pow(2n, k)) == 0n : Nat}
1198  for +hb: {Nat.is_lt(U32.to_nat(b), Nat.pow(2n, k)) == True{} : Bool}
1199  {U32.to_nat(U32.or(a, b)) == Nat.add(U32.to_nat(a), U32.to_nat(b)) : Nat}