proposition: Lemma StepF_eq_equiv : forall (x y : StepFSup), StepF_eq x y <-> msp_eq x y.
proof: Proof. split. - intro H. simpl. rewrite H. apply (ball_refl StepFSup). discriminate. - intro H. apply StepFSupBall_eq. simpl in H. intro e. exact (ball_weak_le StepFSup x y (Qpos_nonneg e) H). Qed.
imports: CoRN.algebra.RSetoid CoRN.metric2.Metric CoRN.metric2.UniformContinuity CoRN.model.totalorder.QposMinMax CoRN.metric2.StepFunctionSetoid CoRN.metric2.StepFunctionMonad CoRN.metric2.UniformContinuity CoRN.model.structures.OpenUnit Coq.QArith.QArith CoRN.model.totalorder.QMinMax Coq.QArith.Qabs CoRN.model.ordfields.Qordfield CoRN.model.metric2.Qmetric CoRN.metric2.Prelength CoRN.algebra.COrdFields2 CoRN.tactics.CornTac