proposition: Lemma bounded_t_dec n t : dec (bounded_t n t).
proof: Proof. Proof using sig_funcs_dec. induction t. - destruct (Compare_dec.gt_dec n x) as [H|H]. + left. now constructor. + right. inversion 1; subst. tauto. - apply vec_all_dec in X as [H|H]. + left. now constructor. + right. inversion 1; subst. apply (inj_pair2_eq_dec _ sig_funcs_dec) in H3 as ->. tauto. Qed.
imports: Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ListEnumerabilityFacts ReducibilityFacts) Undecidability(Shared.ListAutomation Shared.Dec) Coq(Eqdep_dec PeanoNat) Coq.Vectors.Vector Undecidability.Shared.Libs.PSL.Vectors(Vectors) EqdepFacts