fact: Definition is_finite_forA' (ls : list B) (f : B -> A) := forall x, ~SetoidList.InA eqv x ls -> eqA (f x) bot.
imports: Coq.Setoids.Setoid Coq.Program.Program Coq.Program.Wf Coq.Arith.Wf_nat Coq.Classes.Morphisms Coq.Init.Wf Coq.Lists.SetoidList Coq.Arith.PeanoNat Fiat.Common.Coq__8_4__8_5__Compat