proposition: Lemma beq_terms : forall ts us, (fix beq_terms (ts us : terms) := match ts with | nil => match us with | nil => true | _ => false end | t :: ts' => match us with | u :: us' => beq t u && beq_terms ts' us' | _ => false end end) ts us = beq_list beq ts us.
proof: Proof. induction ts; destruct us; refl. Qed.
imports: CoLoR(LogicUtil BoolUtil ListUtil EqUtil ListDec NatUtil ListMax) Coq(Peano_dec)