proposition: Lemma char_num : [char R] =i pred0.
proof: Proof. by case=> // p /=; rewrite !inE pnatr_eq0 andbF. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat seq choice) mathcomp(ssrAC div fintype path bigop order finset fingroup) mathcomp(ssralg poly)