proposition: Lemma Anumeral_numeral n : NS (Anumeral n) = numeral n.
proof: Proof. induction n; trivial. cbn [numeral]. rewrite <- IHn. apply Aeq_NS_eq. cbn -[Anumeral]. now rewrite <- !CR1. Qed.
imports: Undecidability.FOL(Syntax.Facts Semantics.Tarski.FullFacts ZF) Undecidability.FOL.Sets(ZF binZF) Undecidability.FOL.Sets.Models(Aczel Aczel_CE Aczel_TD) Coq(Lia)