proposition: Lemma not_neutral_apps_fun : forall f n (ts : Tes n), ~neutral (apps (Fun f) ts).
proof: Proof. intros f n ts. destruct ts; simpl. fo. rewrite apps_app. simpl. rewrite head_apps. simpl. fo. Qed.
imports: Coq(Morphisms Basics Lia) CoLoR(LogicUtil RelUtil VecOrd VecUtil LAlpha)