proposition: Lemma binop_comm (x y: T): binop x y == binop y x.
proof: Proof. Proof with auto. cut (forall a b, binop a b <= binop b a). intro H. split; apply H. unfold eq, le. simpl. intros. inversion H. subst. clear H. apply BinopBound_sym. apply is_binop_bound with q0 q'... apply Qle_trans with (`q)... Qed.
imports: Coq.QArith.Qabs CoRN.model.ordfields.Qordfield CoRN.model.structures.Qpossec Coq.QArith.Qminmax Coq.setoid_ring.Ring Coq.Program.Program