proposition: Theorem SATn_SAT2 A : fo_form_fin_discr_dec_SAT A -> fo_form_fin_dec_SAT (@Σn_Σ2_enc n A).
proof: Proof. intros (X & ? & Mn & ? & ? & psy & ?). apply SATn_to_SAT2 with X Mn psy; auto. Qed.
imports: List Arith Bool Lia Eqdep_dec 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 decidable fol_ops fo_sig fo_terms fo_logic fo_sat membership hfs reln_hfs)