proposition: Lemma Forall_app : forall P l1 l2, Forall P l1 -> Forall P l2 -> Forall P (l1 ++ l2).
proof: Proof. Proof using. intros. rewrite* Forall_app_eq. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)