proposition: Lemma StepF_imp_imp:forall x y:(StepF iffSetoid), (StepF_imp x y) -> ((StepFfoldProp x)->(StepFfoldProp y)).
proof: Proof. induction x. induction y. auto with *. unfold StepF_imp. unfold StepFfoldProp;simpl;intuition. intros y. unfold StepF_imp, Map2. rewriteStepF. intros. rewrite <- (StepFfoldPropglue y o). rewriteStepF. intuition. Qed.
imports: CoRN.algebra.RSetoid CoRN.metric2.StepFunction CoRN.model.structures.OpenUnit CoRN.tactics.CornTac CoRN.tactics.Qauto CoRN.model.ordfields.Qordfield CoRN.algebra.COrdFields