proposition: Lemma binop_le_compat (x y: T) (v w: T): x <= y -> v <= w -> binop x v <= binop y w.
proof: Proof. intros. apply le_trans with (binop x w); [do 2 rewrite (binop_comm x) |]; apply binop_le_compat_l; auto. Qed.
imports: Coq.QArith.Qabs CoRN.model.ordfields.Qordfield CoRN.model.structures.Qpossec Coq.QArith.Qminmax Coq.setoid_ring.Ring Coq.Program.Program