def ns.d0
import bend-osdev-word64@0.1.1.0/proof_shift.bend as ProofShiftimport Base
import bend-osdev-u32@0.1.0.0/u32.bend as U
import bend-osdev-u32@0.1.0.0/LAWS.bend as UL
187# z + 2^n * 0 = z
188def ns.d0(+n: Nat, +z: Nat) -> {Nat.add(z, U.U32Nat.dbl(n, 0n)) == z : Nat}:
189 Equal.trans(Nat, Nat.add(z, U.U32Nat.dbl(n, 0n)), Nat.add(z, 0n), z, Equal.cong(Nat, Nat, v => Nat.add(z, v), U.U32Nat.dbl(n, 0n), 0n, UL.dbl_zero(n)), UL.nat_add_zero(z))