fact: Definition lambda_calculus_ind_subst {L : lambda_calculus} {A f_var f_app f_abs f_subst f_paths m n} (l : L m) (f : stn m → L n) : lambda_calculus_ind (L := L) A f_var f_app f_abs f_subst f_paths n (subst l f) = f_subst _ _ _ _ (lambda_calculus_ind _ f_var f_app f_abs f_subst f_paths _ l) (λ i, lambda_calculus_ind _ f_var f_app f_abs f_subst f_paths _ (f i)) := pr2 (pr222 L) A f_var f_app f_abs f_subst f_paths m n l f.
imports: UniMath.Foundations.All UniMath.MoreFoundations.All UniMath.Combinatorics.StandardFiniteSets UniMath.Combinatorics.Tuples