proposition: Lemma eqListA_eq {A}: forall l l0 : list A, SetoidList.eqlistA eq l l0 <-> l = l0.
proof: Proof. induction l; split; intros; inversion H; subst; eauto. - f_equal; eapply IHl; eauto. - f_equiv. Qed.
imports: Fiat.Common.Coq__8_4__8_5__Compat Coq.ZArith.ZArith Coq.Lists.List Coq.Lists.SetoidList Coq.Bool.Bool Fiat.Common Fiat.Common.List.Operations Fiat.Common.Equality Fiat.Common.List.FlattenList Fiat.Common.LogicFacts