proposition: Lemma pnatr_eq0 n : (n%:R == 0 :> R) = (n == 0)%N.
proof: Proof. by case: n => [|n]; rewrite ?mulr0n ?eqxx // gt_eqF. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)