proposition: Lemma BZm_of_natms_i x: natp x -> x <> \0c -> inc (BZm_of_nat x) BZms.
proof: Proof. by move => xN xnz;rewrite /BZm_of_nat; Ytac0; apply: indexed_pi;apply /setC1_P. Qed.
imports: mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat)