proposition: Lemma NoFunctionJustFiniteSetOfFunction {A} f a ls : fst (@FiniteSetAndFunctionOfList A f a ls) = FiniteSetOfList ls.
proof: Proof. unfold FiniteSetOfList. unfold FiniteSetAndFunctionOfList. simpl. etransitivity; [ | eapply fst_fold_right ]. reflexivity. Qed.
imports: Coq.Strings.String Coq.Sets.Ensembles Coq.Sets.Finite_sets Coq.Lists.List Coq.Sorting.Permutation Coq.Classes.RelationPairs Fiat.ADT Fiat.ADT.ComputationalADT Fiat.ADTRefinement.Core Fiat.ADTNotation Fiat.ADTRefinement.GeneralRefinements Fiat.Computation Fiat.Common Fiat.Common.Ensembles Fiat.Common.Ensembles.Tactics Fiat.ComputationalEnsembles Fiat.FiniteSetADTs.FiniteSetADTMethodLaws Fiat.FiniteSetADTs.FiniteSetADT