proposition: Lemma Min_less_Max : forall c d : IR, a [<] b -> Min a c [<] Max b d.
proof: Proof. intros. apply leEq_less_trans with a. apply Min_leEq_lft. apply less_leEq_trans with b. assumption. apply lft_leEq_Max. Qed.
imports: CoRN.reals.Q_in_CReals Coq.QArith.Qabs CoRN.reals.CauchySeq