proposition: Lemma single_vertex_guarded_BinMaFin: forall (x0: addr) dv de dg, is_guarded_BinMaFin (fun v : addr => x0 <> v) (fun _ : addr * LR => ~ False) (single_vertex_labeledgraph x0 dv de dg).
proof: Proof. intros. constructor; auto. simpl. constructor. + constructor; simpl; intros. - congruence. - rewrite Intersection_spec in H; destruct H; congruence. + constructor; simpl; intros. - rewrite Intersection_spec in H; destruct H; tauto. - rewrite Intersection_spec in H; destruct H; congruence. + constructor; exists nil; repeat constructor. - inversion H. - inversion H. - simpl; intros. unfold Ensembles.In in H; rewrite Intersection_spec in H; destruct H; congruence. - inversion H. - inversion H. - simpl; intros. unfold Ensembles.In in H; rewrite Intersection_spec in H; destruct H; congruence. 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