proposition: Lemma olex_total1: worder r -> (allf g total_order) -> total_order (olex r g).
proof: Proof. move => wo alto; rewrite olex_lex //; apply orprod_total => //. by move: ax => [pa pb pc]. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat)