proposition: Lemma Forall_tl {A} P (ls : list A) : List.Forall P ls -> List.Forall P (tl ls).
proof: Proof. intro H; destruct H; simpl; try constructor; assumption. 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