proposition: Theorem undecidable_deduction_HF : undecidable deduction_HF.
proof: Proof. apply (undecidability_from_reducibility undecidable_deduction_ZF'). exists add_om. intros phi. apply reduction_deduction. Qed.
imports: Undecidability.Synthetic.Definitions Undecidability.Synthetic.Undecidability Undecidability.FOL(Semantics.Tarski.FullFacts Semantics.Tarski.FullSoundness) Undecidability.FOL.Sets.Models(Aczel_CE Aczel_TD ZF_model HF_model) Undecidability.FOL.Reductions(ZF_to_HF PCPb_to_HF PCPb_to_HFD PCPb_to_ZFeq PCPb_to_ZF PCPb_to_ZFD) Undecidability.FOL.Sets.ZF Undecidability.FOL.ZF Undecidability.PCP(PCP PCP_undec Util.PCP_facts Reductions.PCPb_iff_dPCPb)