proposition: Lemma term_ind_forall2 : forall (P : term -> Prop) (H1 : forall v, P (Var v)) (H2 : forall f v, (forall t, Vin t v -> P t) -> P (Fun f v)), forall t, P t.
proof: Proof. intros. apply term_ind with (Q := fun n (ts : terms n) => forall t, Vin t ts -> P t). exact H1. exact H2. contr. simpl. intuition. subst t1. exact H. Qed.
imports: CoLoR(ListUtil LogicUtil EqUtil BoolUtil NatUtil VecUtil VecMax ListMax)