proposition: Lemma terms_of_aterms_eq : forall n (ts : aterms n), (fix terms_of_aterms n (ts : aterms n) := match ts with | Vnil => nil | Vcons u us => term_of_aterm u :: terms_of_aterms _ us end) n ts = terms_of_aterms ts.
proof: Proof. induction ts; simpl; intros. refl. rewrite IHts. refl. Qed.
imports: CoLoR(LogicUtil ATerm VecUtil) CoLoR(term_spec EqUtil) CoLoR(NatUtil) Coq(List Relations) CoLoR(term SN ASubstitution)