proposition: Lemma subterm_ind : forall (P : term -> Prop) (IH : forall t, (forall u, subterm u t -> P u) -> P t), forall t, P t.
proof: Proof. intros. apply forall_subterm_eq. apply subterm_ind_sub. hyp. Qed.
imports: Coq(Setoid) CoLoR(LogicUtil VecUtil ListUtil BoolUtil NatUtil RelUtil)