proposition: Lemma vint_app_term_elim_l : forall n (Ts : Tys n) p (ts : Tes p) q (us : Tes q), vint Ts (Vapp ts us) -> vint Ts ts.
proof: Proof. intros n Ts p ts q us; revert p ts q us n Ts. induction ts; intros q us m Ts; simpl; destruct Ts; fo. Qed.
imports: Coq(Morphisms Basics Lia) CoLoR(SN VecUtil LogicUtil SetUtil)