proposition: Lemma dp_step_equiv_aux_2 : forall r l, rdp_step (axiom (ddp R2)) R3 r l <-> rdp_step (axiom (ddp R2)) R4 r l.
proof: Proof. intros r l. split. inversion 1;subst. rewrite rwr_list_equiv in H0. constructor 1 with l2; assumption. inversion 1;subst. rewrite <- rwr_list_equiv in H0. constructor 1 with l2; assumption. Qed.
imports: Coq(Relations List Setoid) CoLoR(weaved_relation closure equational_theory_spec dp modular_dp terminaison)