proposition: Lemma nb_symb_occs_fix : forall n (ts : terms n), (fix nb_symb_occs_terms n (ts : terms n) := match ts with | Vnil => 0 | Vcons u us => nb_symb_occs u + nb_symb_occs_terms _ us end) _ ts = nb_symb_occs_terms ts.
proof: Proof. induction ts; simpl; intros. refl. rewrite IHts. refl. Qed.
imports: CoLoR(ListUtil LogicUtil EqUtil BoolUtil NatUtil VecUtil VecMax ListMax)