proposition: Lemma minFiniteValidityUndec : undecidable FVAL.
proof: Proof. apply (undecidability_from_reducibility H10UPC_SAT_compl_undec). eapply reduces_transitive. * eexists. apply fval_reduction. * eexists. apply frag_reduction_fval. Qed.
imports: Undecidability.DiophantineConstraints(H10C H10C_undec) Undecidability.FOL.Syntax(Core BinSig) Undecidability.Synthetic(Definitions Undecidability ReducibilityFacts)