law to_nat_xor_split
import lawful-words@0.1.0.0/proof_u32.bend as ProofU32import Base
1206law to_nat_xor_split:
1207 for +a: U32
1208 for +b: U32
1209 for +k: Nat
1210 for +ha: {Nat.mod(U32.to_nat(a), Nat.pow(2n, k)) == 0n : Nat}
1211 for +hb: {Nat.is_lt(U32.to_nat(b), Nat.pow(2n, k)) == True{} : Bool}
1212 {U32.to_nat(U32.xor(a, b)) == Nat.add(U32.to_nat(a), U32.to_nat(b)) : Nat}