proposition: Lemma subst_term_shift (t : term) s : t`[↑]`[s..] = t.
proof: Proof. rewrite subst_term_comp. apply subst_term_id. now intros [|]. Qed.
imports: Undecidability.Synthetic(Definitions DecidabilityFacts EnumerabilityFacts ListEnumerabilityFacts ReducibilityFacts) Undecidability(Shared.ListAutomation Shared.Dec) Coq(Eqdep_dec PeanoNat Nat) Coq.Vectors.Vector Undecidability.Shared.Libs.PSL.Vectors(Vectors) EqdepFacts