proposition: Lemma refine_UnIndexedEnsembleListEquivalence {A} : forall s s', (forall l, UnIndexedEnsembleListEquivalence s' l -> UnIndexedEnsembleListEquivalence s l) -> refine {queriedList : list A | UnIndexedEnsembleListEquivalence s queriedList} {queriedList : list A | UnIndexedEnsembleListEquivalence s' queriedList}.
proof: Proof. intros ? ?; computes_to_inv; computes_to_econstructor. computes_to_inv. eauto. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.Vectors.Vector Coq.Strings.Ascii Coq.Bool.Bool Coq.Lists.List Fiat.Common.SumType Fiat.Computation.ListComputations Fiat.QueryStructure.Automation.AutoDB Bedrock.Word Bedrock.Memory