proposition: Lemma subst_bounded_up_t {ff : falsity_flag} i m sigma : (forall i', i' < i -> bounded_t m (sigma i')) -> bounded_t (S m) (up sigma i).
proof: Proof. intros Hb. unfold up,funcomp,scons. destruct i. - econstructor. lia. - eapply subst_bounded_max_t. 2: apply Hb. 2:lia. intros ii Hii. econstructor. lia. 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