proposition: Lemma same_relation_list_trans: forall {A} (rs1 rs2 rs3: list (relation A)), same_relation_list rs1 rs2 -> same_relation_list rs2 rs3 -> same_relation_list rs1 rs3.
proof: Proof. intros. rename H0 into HH. revert rs3 HH; induction H; intros; inversion HH; subst; constructor. + rewrite H; auto. + auto. Qed.
imports: Coq.Classes.Morphisms Coq.Lists.List CertiGraph.lib.Coqlib CertiGraph.lib.List_ext CertiGraph.lib.List_Func_ext CertiGraph.lib.Relation_ext