proposition: Lemma gc_graph_iso_sym: forall g1 roots1 g2 roots2, gc_graph_iso g1 roots1 g2 roots2 -> gc_graph_iso g2 roots2 g1 roots1.
proof: Proof. intros. unfold gc_graph_iso in *. destruct H as [vmap12 [vmap21 [emap12 [emap21 [? ?]]]]]. exists vmap21, vmap12, emap21, emap12. split. - destruct H0 as [[?H _] _]. eapply map_root_map_bijective; eauto. - now apply lp_graph_iso_exp_sym. Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics compcert.lib.Integers compcert.common.Values VST.veric.base VST.veric.Clight_lemmas VST.veric.val_lemmas VST.veric.shares VST.msl.seplog VST.msl.shares VST.zlist.sublist VST.floyd.coqlib3 VST.floyd.functional_base VST.floyd.data_at_rec_lemmas CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.path_lemmas CertiGraph.graph.subgraph2 CertiGraph.graph.graph_relation CertiGraph.graph.graph_isomorphism CertiGraph.graph.reachable_ind CertiGraph.CertiGC.GCGraph