proposition: Lemma list_n_bound n k : k > n -> ~ k el list_n n.
proof: Proof. induction n in k |- *; intros Hk. - intros [H|[]]. lia. - intros [<-|H]; try lia. apply IHn in H; trivial. lia. 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