fact: Parameter equiv_in_list : forall f g (f_stat : status P f= Lex) (g_stat: status P g = Lex) l1 l2, length l1 = length l2 -> prec_eq P f g -> (forall t1 t2, In (t1, t2) (combine l1 l2) -> equiv t1 t2) -> equiv (Term f l1) (Term g l2).
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)