def add_succ
import bend-osdev-bpf@0.1.0.0/PROOF.bend as PROOFimport Base
192def add_succ(+a: Nat, +n: Nat) -> {Nat.add(a, 1n+n) == 1n+Nat.add(a, n) : Nat}:
193 match a:
194 case 0n:
195 {==}
196 case 1n+p:
197 Equal.cong(Nat, Nat, k => 1n+k, Nat.add(p, 1n+n), 1n+Nat.add(p, n), add_succ(p, n))