proposition: Lemma fold_right_UniqueListOfList {A} (f : W -> A -> A) (a : A) ls : List.fold_right f a (UniqueListOfList ls) = snd (FiniteSetAndFunctionOfList f a ls).
proof: Proof. apply fold_right_snd_FiniteSetAndListOfList. 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