proposition: Lemma conjc_eq0 : forall x, (x ^* == 0) = (x == 0).
proof: Proof. by move=> [a b]; rewrite !eq_complex /= eqr_oppLR oppr0. Qed.
imports: HB(structures) mathcomp.ssreflect.ssreflect mathcomp(ssrfun ssrbool eqtype ssrnat seq choice fintype) mathcomp(bigop order ssralg ssrint div ssrnum rat poly closed_field) mathcomp(polyrcf matrix mxalgebra tuple mxpoly zmodp binomial realalg) mathcomp(mxpoly)