def pred_add

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/argon2/memory.bend:239

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

239def pred_add(+base: Nat, +p: Nat) -> {Nat.sub(Nat.add(base, 1n+p), 1n) == Nat.add(base, p) : Nat}:
240  %Equal.sym(Nat, Nat.add(base, 1n+p), 1n+Nat.add(base, p), N.add_succ(base, p)) : {Nat.sub(_, 1n) == Nat.add(base, p) : Nat}
241  N.sub_zero(Nat.add(base, p))