proposition: Lemma eq_equiv: forall t1 t2, eq t1 t2 -> equiv t1 t2.
proof: Proof. intros t1 t2 H. rewrite H. reflexivity; trivial. Qed.
imports: Coq(Bool Peano List PeanoNat) CoLoR(closure more_list equiv_list list_permut dickson) Coq(Relations Wellfounded Arith Wf_nat Recdef Program Morphisms Lia) CoLoR(term_spec term decidable_set ordered_set NatCompat)