proposition: Lemma homographicacc_3 : forall (a b c d : Z) (p : Qpositive), homographicAcc a b c d p -> forall xs : Qpositive, p = nR xs -> ~ top_more a b c d -> ~ top_more c d a b -> homographicAcc a (a + b) c (c + d) xs.
proof: Proof. intros a b c d p HAcc; case HAcc; intros; try solve [ Falsum ]; [ rewrite H2 in H; clear H2; discriminate H | let T_local := eval compute in (f_equal Qpositive_tail H2) in (rewrite <- T_local; assumption) | discriminate H2 ]. Defined.
imports: QArithSternBrocot(Merge_Order) Coq(Wf_nat)