fact: Fixpoint rSubstList (s:rTerm) (x:nat) (A: list rTerm): rTerm := match s with | rVar n => if Dec ( n < x )then rVar n else nth (n-x) A (rVar n) | rApp s t => (rSubstList s x A) (rSubstList t x A) | rLam s => rLam (rSubstList s (S x) A) | rRho s => rRho (rSubstList s (S x) A) | rConst x => rConst x end.
imports: Undecidability.L.Tactics(LClos) ZArith FunInd