proposition: Lemma in_seq_false_nil_iff : forall {A} (seq: list A), (forall (item: A), (List.In item seq <-> False)) <-> (seq = []).
proof: Proof. intros. destruct seq; simpl in *; try tauto. split; intro H. pose proof (H a); intuition. discriminate. 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