proposition: Lemma numeral_trans n : trans (numeral n).
proof: Proof. Proof using VIEQ M_ZF. induction n; cbn. - intros x H. now apply M_eset in H. - intros x [H| ->] % sigma_el; try apply sigma_sub. apply IHn in H. intuition eauto using sigma_sub. 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)