proposition: Lemma top_more_1 : forall a b c d : Z, top_more a b c d -> (0 < a - c + (b - d))%Z.
proof: Proof. intros. case H. intros. elim H0. intros. replace 0%Z with (0 + 0)%Z. apply Zplus_le_lt_compat. unfold Zminus in |- *. apply Zle_left. assumption. apply Zlt_minus. assumption. constructor. intro. elim H0. intros. replace 0%Z with (0 + 0)%Z. apply Zplus_lt_le_compat. apply Zlt_minus. assumption. unfold Zminus in |- *. apply Zle_left. assumption. constructor. Defined.
imports: QArithSternBrocot(Merge_Order) Coq(Wf_nat)