proposition: Lemma ssr_lt_wf : well_founded (fun x y => x < y).
proof: Proof. by apply: (well_founded_lt_compat _ id)=>x y /ltP. Defined.
imports: HB(structures) Coq(ssreflect ssrfun ssrbool Arith.Wf_nat) mathcomp(eqtype ssrnat div seq path) mathcomp(ssralg fintype perm tuple choice generic_quotient) mathcomp(matrix bigop zmodp mxalgebra poly) stronglydiscrete