proposition: Lemma form_discrete {ff : falsity_flag} : discrete (form ff).
proof: Proof. apply discrete_iff. constructor. apply dec_form. - intros ? ?. unfold dec. repeat decide equality. - intros ? ?. unfold dec. repeat decide equality. - intros [] []. now left. - intros [] []. now left. Qed.
imports: Undecidability.PCP(PCP Util.PCP_facts) Undecidability.FOL(Deduction.FragmentNDFacts Semantics.Tarski.FragmentFacts Semantics.Tarski.FragmentSoundness Syntax.Core Syntax.Facts) Undecidability.FOL(FOL) Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ReducibilityFacts MoreReducibilityFacts) Undecidability.PCP.Reductions.PCPb_iff_dPCPb Undecidability(Shared.ListAutomation)