proposition: Lemma is_BinMaFin_LGraph_Graph: forall (g: LGraph) (P: LGraph -> pred), is_BinMaFin g -> P g |-- EX g: Graph, P g.
proof: Proof. intros. destruct H as [X _]. apply (exp_right (Build_GeneralGraph _ _ _ BinMaFin g X)). simpl. 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