End Equiv_VS.
(** * Multiplication and inverse *)
(** Domination *)

Lemma domin_mult_l :
forall {T} {F : (T -> Prop) -> Prop} {FF : Filter F} (f g h : T -> R),
is_domin F f g -> is_domin F (fun x => h x * f x) (fun x => h x * g x).