proposition: Lemma compare_succ_succ p q : (succ p ?= succ q) = (p ?= q).
proof: Proof. revert q. induction p as [p|p|]; intro q; destruct q as [q|q|]; simpl; simpl_compare; trivial; apply compare_succ_l || apply compare_succ_r || (now destruct p) || (now destruct q). Qed.
imports: BinNums Eqdep_dec EqdepFacts RelationClasses Morphisms Setoid Equalities Orders OrdersFacts GenericMinMax PeanoNat BinPosDef