proposition: Lemma subst_appL_c : forall (M: Term) (Mapp: isApp M) G, correct_subst M G -> correct_subst (appBodyL Mapp) G.
proof: Proof. intro M; term_inv M. fo. Qed.
imports: CoLoR(RelExtras ListPermutation TermsConv ListUtil ListExtras LogicUtil) Coq(Arith Lia)