proposition: Lemma glue_StepF_eq : forall {X : RSetoid} (s:StepF X) (s1 s2:StepF X), forall a, s1 === (SplitL s a) -> s2 === (SplitR s a) -> (glue a s1 s2) === s.
proof: Proof. intros X s s1 s2 a H0 H1. unfold StepF_eq. rewrite MapGlue. rewrite ApGlue. split; assumption. 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