proposition: Lemma map_eq_nil_inv : forall {A B} (f: A -> B) seq, map f seq = [] -> seq = [].
proof: Proof. intros; destruct seq; simpl in *; try discriminate; trivial. 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