proposition: Lemma vint_neg : forall n (Ts : Tys n) p (ts : Tes p), Vforall (neg a) Ts -> vint J Ts ts -> vint I Ts ts.
proof: Proof. intros n Ts p ts h. destruct (vint_mon Ts ts) as [_ i]. fo. Qed.
imports: Coq(Morphisms Basics Lia) CoLoR(SN VecUtil LogicUtil SetUtil)