proposition: Lemma forallb_imp_lforall f : forall l, (forall x, f x = true -> P x) -> forallb f l = true -> lforall l.
proof: Proof. induction l; simpl; intros; Algebra.bool; auto. Qed.
imports: CoLoR(LogicUtil EqUtil RelUtil BoolUtil NatUtil) Coq(Setoid SetoidList FunInd)