proposition: Lemma divIf y : y != 0 -> injective (fun x => x / y).
proof: Proof. by rewrite -invr_eq0; apply: mulIf. Qed.
imports: HB(structures) mathcomp(ssreflect ssrfun ssrbool eqtype ssrnat div seq) mathcomp(choice fintype finfun bigop prime binomial)