proposition: Lemma noConfusion_nat_k (x y : nat) (p : noConf_nat x y) : x = y.
proof: Proof. induction x in y, p |- *; destruct y. destruct p. reflexivity. destruct p. destruct p. apply Top.cong. apply IHx. apply p. Defined.
imports: Equations Utf8 DepElimDec EqDecInstances