proposition: Lemma Forall_rev_eq : forall P l, Forall P (rev l) = Forall P l.
proof: Proof. Proof using. intros. extens. iff M. { rewrite <- rev_rev. applys~ Forall_rev. } { applys~ Forall_rev. } Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)