proposition: Lemma dp'_is_dp : forall t1 t2, Rdp' t2 t1 -> Rcdp t2 t1.
proof: Proof. intros t1 t2 H; inversion H; subst. apply Rdp_step with l2; trivial. inversion H1; subst. apply instance. inversion H4; subst; trivial. Qed.
imports: Coq(List Relations Wellfounded Arith Recdef Setoid) CoLoR(closure more_list weaved_relation term_spec equational_theory_spec dp) CoLoR(NatCompat)