fact: Fixpoint lexn {n A} (eqA gtA : relation A) := match n as n return relation (prodn n A) with | 0 => empty_rel | S n' => lex gtA eqA (lexn eqA gtA) end.
imports: Coq(Morphisms Basics) CoLoR(SN LogicUtil NatUtil VecUtil VecOrd ListUtil RelUtil)