fact: Definition lex (A B : Set) (eq_A_dec : forall a1 a2, {a1=a2}+{a1<>a2}) (o1 : relation A) (o2 : relation B) (s t : _ * _) := match s with | (s1,s2) => match t with | (t1,t2) => if eq_A_dec s1 t1 then o2 s2 t2 else o1 s1 t1 end end.
imports: List more_list list_permut dickson Relations Wellfounded Arith Wf_nat term