proposition: Lemma symb_sup_list : forall R Rlist, (forall l r, R r l <-> In (l,r) Rlist) -> {Slist | forall f g, symb_sup R f g <-> In (f,g) Slist}.
proof: Proof. intros R Rlist Rlist_ok. exact (symb_sup_gen_list R Rlist R Rlist Rlist_ok Rlist_ok). Defined.
imports: Coq(List Relations Wellfounded Arith Recdef Setoid) CoLoR(closure more_list weaved_relation term_spec equational_theory_spec dp graph_dp terminaison interp)