proposition: Lemma dup_int_rules_int_red : forall f v t, red R (Fun' (hd_symb f) v) t -> int_red R (Fun' (hd_symb f) v) t.
proof: Proof. intros. redtac. ex l r c s. split. destruct c. simpl in *. rewrite forallb_forall in int_hyp. ded (int_hyp _ lr). revert H. compute. case_eq l. discr. intro f0. case_eq f0. discr. intros. subst l. simpl in xl. discr. congruence. tauto. Qed.
imports: CoLoR(ATrs ListUtil VecUtil LogicUtil RelUtil SN)