proposition: Lemma Forall_cons_eq : forall P l x, Forall P (x::l) = (P x /\ Forall P l).
proof: Proof. Proof using. intros. extens. iff M. { inverts* M. } { constructors*. } Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)