proposition: Lemma minValidityUndec : undecidable (fun k : minimalForm falsity_off => valid k).
proof: Proof. apply (undecidability_from_reducibility H10UPC_SAT_undec). exact validReduction. Qed.
imports: Undecidability.DiophantineConstraints(H10C H10C_undec) Undecidability.FOL.Syntax(Core BinSig) Undecidability.Synthetic(Definitions Undecidability ReducibilityFacts)