proposition: Lemma sat1 : (complement satis (¬ F)) -> complement (complement H10UPC_SAT) h10.
proof: Proof. intros Hc1 Hc2. apply Hc1. exists dom, IB, (fun b => Num 0). intros H. apply Hc2. eapply IB_fulfills. exact H. Qed.
imports: Undecidability.DiophantineConstraints(H10C) Undecidability.DiophantineConstraints.Util(H10UPC_facts) Undecidability.FOL(Syntax.Facts Deduction.FullNDFacts Semantics.Tarski.FullSoundness Semantics.Tarski.FullFacts Syntax.BinSig) Undecidability.Shared(Dec) Undecidability.Shared.Libs.PSL(Numbers) Coq(Arith Lia List) Undecidability.Synthetic.Definitions