proposition: Lemma Split_ind : forall s a (P:StepF*StepF -> Prop), (P (SplitL s a,SplitR s a)) -> P (Split s a).
proof: Proof. intros s a P. unfold SplitL, SplitR. destruct (Split s a). auto with *. Qed.
imports: CoRN.model.structures.OpenUnit CoRN.tactics.CornTac CoRN.tactics.Qauto CoRN.model.ordfields.Qordfield CoRN.algebra.COrdFields