proposition: Lemma Qpositive_c_nR : forall p q n' : nat, q < p -> Qpositive_c p q (S n') = nR (Qpositive_c (p - q) q n').
proof: Proof. intros p q n Hqp. generalize (lt_minus_neq q p Hqp). intros Hpq. apply (Qpositive_c_1_1 _ _ n Hpq). Qed.
imports: Coq(FunInd) QArithSternBrocot(Field_Theory_Q)