proposition: Lemma ltr0n n : (0 < n%:R :> R) = (0 < n)%N.
proof: Proof. by case: n => //= n; apply: ltr0Sn. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)