proposition: Lemma up_var sigma : (forall n, sigma n = var n) -> forall n, up sigma n = var n.
proof: Proof. destruct n; cbn; trivial. unfold funcomp. now rewrite H. 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