fact: Definition disjointed_union_labeledgraph_exists_ll: forall (G1 G2: LabeledGraph V E DV DE DG), disjointed_guard (vvalid G1) (vvalid G2) (evalid G1) (evalid G2) -> (exists f: forall v, Decidable (vvalid G1 v), True) -> (exists f: forall e, Decidable (evalid G1 e), True) -> exists G: LabeledGraph V E DV DE DG, guarded_labeled_graph_equiv (vvalid G1) (evalid G1) G1 G /\ guarded_labeled_graph_equiv (vvalid G2) (evalid G2) G2 G /\ Prop_join (vvalid G1) (vvalid G2) (vvalid G) /\ Prop_join (evalid G1) (evalid G2) (evalid G).
imports: Coq.Arith.Arith Coq.Logic.ProofIrrelevance Coq.Logic.FunctionalExtensionality Coq.Classes.Morphisms Coq.Classes.Equivalence CertiGraph.lib.Coqlib CertiGraph.lib.Ensembles_ext CertiGraph.lib.relation_list CertiGraph.lib.List_ext CertiGraph.lib.Equivalence_ext CertiGraph.lib.EquivDec_ext VST.msl.Coqlib2 CertiGraph.graph.graph_model CertiGraph.graph.path_lemmas CertiGraph.graph.reachable_ind CertiGraph.graph.graph_gen CertiGraph.graph.graph_relation