fact: Definition disjointed_union_pregraph_sig_l: forall (G1 G2: PreGraph V E), Disjoint _ (evalid G1) (evalid G2) -> (forall e, Decidable (evalid G1 e)) -> { G: PreGraph V E | guarded_structurally_identical (vvalid G1) (evalid G1) G1 G /\ guarded_structurally_identical (vvalid G2) (evalid G2) G2 G /\ Same_set (Union _ (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