proposition: Lemma dominatesP (R: realType) A (Q P : A -> R) : P `<< Q <-> forall a, Q a = 0%R -> P a = 0%R.
proof: Proof. by rewrite /dominates; unlock. Qed.
imports: mathcomp(all_ssreflect ssralg fingroup perm matrix) mathcomp(all_algebra vector reals normedtype) mathcomp(mathcomp_extra boolp) mathcomp(Rstruct) ssrR logb realType_ext ssr_ext ssralg_ext bigop_ext