proposition: Lemma rwr_incl : forall (R1 R2 : term -> term -> Prop), (forall t1 t2, R1 t1 t2 -> R2 t1 t2) -> forall t1 t2, rwr R1 t1 t2 -> rwr R2 t1 t2.
proof: Proof. intros R1 R2 Incl t1 t2 H; induction H; auto. apply t_step; apply one_step_incl with R1; trivial. apply t_trans with y; auto. apply one_step_incl with R1; trivial. Qed.
imports: Coq(List Relations Wellfounded Arith Setoid) CoLoR(closure more_list weaved_relation dickson term_spec equational_theory_spec)