def add_eq0_r

bend-collections-laws-math@1.0.0.0 · proofs/math/random/uint64n.bend:43

import Base
import bend-collections-laws-math@1.0.0.0/proofs/lib/nat.bend as N

43def add_eq0_r(+a: Nat, +b: Nat, +h: {Nat.add(a, b) == 0n : Nat}) -> {b == 0n : Nat}:
44  match a:
45    case 0n:
46      h
47    case 1n+p:
48      Empty.absurd({b == 0n : Nat}, N.succ_zero(Nat.add(p, b), h))