proposition: Lemma Qhomographic_Qpositive_to_Qpositive_0 : forall (a b c d : Z) (p : Qpositive) (hyp : homographicAcc a b c d p), p = One -> forall (H1 : (0 < a + b)%Z) (H2 : (0 < c + d)%Z), Qhomographic_Qpositive_to_Qpositive a b c d p hyp = positive_fraction_encoding (a + b) (c + d) H1 H2.
proof: Proof. intros. apply trans_eq with (Qhomographic_Qpositive_to_Qpositive a b c d One (homographicacc0 a b c d One (refl_equal One) H1 H2)). apply Qhomographic_Qpositive_to_Qpositive_equal_strong; repeat reflexivity. assumption. simpl in |- *. apply positive_fraction_encoding_equal. Defined.
imports: QArithSternBrocot(Merge_Order) Coq(Wf_nat)