proposition: Lemma list_numerals_inductive x n : hfs_inductive x -> forall y, y el list_numerals n -> hfs_mem y x.
proof: Proof. intros H y [k[<- Hk]] % in_map_iff. now apply numeral_inductive. 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