proposition: Lemma form0_eq0 : M = 0 -> forall u v, '[u, v] = 0.
proof: Proof. by rewrite/form=> -> u v; rewrite mulmx0 mul0mx mxE. Qed.
imports: HB(structures) mathcomp(all_ssreflect ssralg fingroup zmodp poly ssrnum) mathcomp(matrix mxalgebra vector falgebra ssrnum algC algnum) mathcomp(fieldext) mathcomp(vector)