proposition: Fact Σfull_mon_rec_syms A : fol_syms (Σfull_mon_rec A) = nil.
proof: Proof. induction A as [ | r v | b A HA B HB | q A HA ]. 1,2,4: simpl; tauto. simpl; rewrite HA, HB; 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.FOL.TRAKHTENBROT(notations utils fol_ops fo_sig fo_terms fo_logic fo_sat Sig_no_syms)