proposition: Lemma is_BinMaFin_si': forall (g1 g2: LGraph), g1 ~=~ g2 -> is_BinMaFin' g1 -> is_BinMaFin' g2.
proof: Proof. intros. destruct H0 as [[?H ?H ?H] _]. apply (bin_graph_si _ _ H) in H0. apply (math_graph_si' _ _ H) in H1. apply (finite_graph_si _ _ H) in H2. constructor; constructor; auto. Qed.
imports: CertiGraph.lib.Ensembles_ext Coq.Lists.List VST.msl.seplog VST.msl.log_normalize CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.iter_sepcon CertiGraph.msl_ext.seplog CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_computable CertiGraph.graph.reachable_ind CertiGraph.graph.subgraph2 CertiGraph.graph.graph_gen CertiGraph.graph.BinGraph CertiGraph.graph.MathGraph CertiGraph.graph.FiniteGraph CertiGraph.msl_application.Graph Coq.Logic.Classical