proposition: Lemma one_step_equiv : forall r l, one_step R3 r l <-> one_step R4 r l.
proof: Proof. intros r l. split; apply one_step_incl. intros; rewrite <- R3_equiv_R4; assumption. intros; rewrite R3_equiv_R4; assumption. Qed.
imports: Coq(Relations List Setoid) CoLoR(weaved_relation closure equational_theory_spec dp modular_dp terminaison)