proposition: Lemma SubEnsembleInsertRefl : forall (kv : Key * Value) (r : Ensemble (Key * Value)), SubEnsembleInsert kv r r.
proof: Proof. unfold SubEnsembleInsert, EnsembleInsert, EnsembleReplace, EnsembleRemove; intros; eauto. Qed.
imports: Coq.Sets.Ensembles Coq.Lists.List Coq.Strings.String Fiat.Common Fiat.Computation Fiat.ADT.ADTSig Fiat.ADT.Core Fiat.ADT.ComputationalADT Fiat.Common.BoundedLookup Fiat.Common.ilist Fiat.ADTNotation.BuildADTSig Fiat.Common.Coq__8_4__8_5__Compat