proposition: Lemma subst_bounded_max_t {ff : falsity_flag} n m t sigma : (forall i, i < n -> bounded_t m (sigma i)) -> bounded_t n t -> bounded_t m (t`[sigma]).
proof: Proof. intros Hi. induction 1 as [|? ? ? IH]. - cbn. apply Hi. lia. - cbn. econstructor. intros t [x [Hx <-]]%vector_in_map. now apply IH. 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