proposition: Lemma Forall_last : forall P l x, Forall P l -> P x -> Forall P (l & x).
proof: Proof. Proof using. intros. rewrite* Forall_last_eq. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)