proposition: Lemma list_n_nodup n : NoDup (list_n n).
proof: Proof. induction n; cbn; constructor. - intros []. - constructor. - apply list_n_bound. lia. - apply IHn. 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