def un.add_succ
import bend-osdev-u32@0.1.0.0/PROOF.bend as PROOFimport Base
69def un.add_succ(x: Nat, -y: Nat) -> {Nat.add(x, 1n+y) == 1n+Nat.add(x, y) : Nat}:
70 match x:
71 case 0n:
72 {==}
73 case 1n+p:
74 un.succ_cong(Nat.add(p, 1n+y), 1n+Nat.add(p, y), un.add_succ(p, y))