proposition: Lemma inb_equiv : forall (A:Type) aeq_bool f l, (forall f g:A, f=g <-> aeq_bool f g = true) -> (In f l <-> inb _ aeq_bool f l=true).
proof: Proof. intros A aeq_bool f l H. functional induction (inb _ aeq_bool f l). simpl;intuition. simpl. rewrite H. case (aeq_bool g f);simpl. clear;intuition. rewrite (IHb). intuition. Qed.
imports: Coq(List Bool FunInd) CoLoR(weaved_relation closure term_spec terminaison)