proposition: Lemma compare_cont_Gt_not_Gt p q : compare_cont Gt p q <> Gt <-> p < q.
proof: Proof. rewrite compare_cont_Gt_Gt. unfold ge, lt, compare. now destruct compare_cont; split; try apply comparison_eq_stable. Qed.
imports: BinNums Eqdep_dec EqdepFacts RelationClasses Morphisms Setoid Equalities Orders OrdersFacts GenericMinMax PeanoNat BinPosDef