fact: Definition lex (A B : Type) (eq_bool : A -> A -> bool) (o1 : relation A) (o2 : relation B) (s t : _ * _) := match s with | (s1,s2) => match t with | (t1,t2) => if eq_bool s1 t1 then o2 s2 t2 else o1 s1 t1 end end.
imports: Coq(Bool Peano List PeanoNat) CoLoR(closure more_list equiv_list list_permut dickson) Coq(Relations Wellfounded Arith Wf_nat Recdef Program Morphisms Lia) CoLoR(term_spec term decidable_set ordered_set NatCompat)