proposition: Lemma subst_bounded_term t sigma k : bounded_t k t -> t`[iter up k sigma] = t.
proof: Proof. induction 1. - now apply subst_up_var. - cbn. f_equal. rewrite <-(Vector.map_id _ _ v) at 2. apply Vector.map_ext_in. auto. 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