proposition: Lemma KVEnsemble_EquivalentKeys_Replace {B C} : forall (ens : Ensemble (Key * B)) (ens' : Ensemble (Key * C)) (EquivKeys : KVEnsemble_EquivalentKeys ens ens') kb c, KVEnsemble_EquivalentKeys (EnsembleReplace kb ens) (EnsembleReplace (fst kb, c) ens').
proof: Proof. unfold KVEnsemble_EquivalentKeys, EnsembleReplace, EnsembleRemove in *; simpl in *; intuition; injections; eauto. apply H in H3; destruct_ex; eauto. apply H0 in H3; destruct_ex; eauto. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.Strings.String Coq.ZArith.ZArith Coq.Lists.List Coq.Logic.FunctionalExtensionality Coq.Sets.Ensembles Computation ADT ADTRefinement ADTNotation BuildADTRefinements KVEnsembles