proposition: Theorem FIN_DISCR_DEC_nSAT_FIN_DEC_2SAT n : FSAT' (Σrel n) ⪯ᵢ FSAT (Σrel 2).
proof: Proof. exists (@Σn_Σ2_enc n); intros A; split. + apply SATn_SAT2. + intros H; apply fo_form_fin_dec_SAT_fin_discr_dec, SAT2_SATn, H. Qed.
imports: List Arith Bool Lia Eqdep_dec Undecidability.Synthetic.Definitions Undecidability.Synthetic.ReducibilityFacts Undecidability.Synthetic.InformativeDefinitions Undecidability.Synthetic.InformativeReducibilityFacts Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list utils_nat finite) Undecidability.Shared.Libs.DLW.Vec(pos vec) Undecidability.Shared.Libs.DLW.Wf(wf_finite) Undecidability.FOL.TRAKHTENBROT(notations utils decidable bpcp fo_sig fo_terms fo_logic fo_sat red_utils Sig_discrete BPCP_SigBPCP Sig_rem_syms Sig_uniform Sig_one_rel Sig_rem_cst Sign_Sig2 Sig2_Sign Sign_Sig Sig_Sig_fin Sig2_SigSSn1 Sign1_Sig )