proposition: Lemma numeral_trans n : trans (numeral n).
proof: Proof. Proof using M_ZF VIEQ. 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) Undecidability.FOL(Sets.ZF) Undecidability.FOL(ZF) Undecidability.FOL.TRAKHTENBROT(hfs) Undecidability.Shared.Libs.DLW.Utils(finite) Undecidability(Shared.ListAutomation) Lia