proposition: Lemma Qpositive_c_equal_strong : forall m1 m2 n1 n2 p1 p2 : nat, m1 = m2 -> n1 = n2 -> 0 < m1 -> 0 < n1 -> m1 + n1 <= p1 -> m2 + n2 <= p2 -> Qpositive_c m1 n1 p1 = Qpositive_c m2 n2 p2.
proof: Proof. intros m1 m2 n1 n2 p1 p2 Hm Hn Hm' Hn' H1 H2; subst; apply Qpositive_c_equal; assumption. Qed.
imports: Coq(FunInd) QArithSternBrocot(Field_Theory_Q)