proposition: Lemma GLabelMapFacts_map_add_1 : forall (elt B : Type) (f : elt -> B) (k : GLabelMapFacts.M.key) (v : elt) (m : GLabelMapFacts.M.t elt) m0, GLabelMapFacts.M.Equal (GLabelMapFacts.M.map f m) m0 -> GLabelMapFacts.M.Equal (GLabelMapFacts.M.map f (m ### k ->> v)) (m0 ### k ->> f v).
proof: Proof. intros * H; rewrite GLabelMapFacts.map_add, H; reflexivity. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat CertifiedExtraction.Extraction.QueryStructures.Basics CertifiedExtraction.Extraction.QueryStructures.TupleToListW CertifiedExtraction.Extraction.QueryStructures.EnsemblesOfTuplesAndListW CertifiedExtraction.Extraction.QueryStructures.CallRules.CallRules CertifiedExtraction.Extraction.QueryStructures.Wrappers Fiat.QueryStructure.Implementation.DataStructures.BagADT.QueryStructureImplementation Bedrock.Platform.Facade.CompileUnit2 CertifiedExtraction.ADT2CompileUnit CertifiedExtraction.Extraction.Extraction CertifiedExtraction.Extraction.QueryStructures.Decompose Bedrock.Memory Bedrock.Platform.Facade.DFModule Bedrock.Platform.Facade.CompileUnit2