proposition: Lemma Zpos_eq_iff : forall p q, p = q <-> Z.pos p = Z.pos q.
proof: Proof. Proof (fun p q => iff_sym (Pos2Z.inj_iff p q)). #[global] Hint Immediate Zsucc_pred: zarith. Definition Zne (x y:Z) := x <> y. Ltac elim_compare com1 com2 := case (Dcompare (com1 ?= com2)%Z); [ idtac | let x := fresh "H" in (intro x; case x; clear x) ]. Lemma ZL0 : 2%nat = (1 + 1)%nat. Proof. reflexivity. Qed.
imports: BinNums BinPos Pnat BinNat Bool Equalities GenericMinMax OrdersFacts ZAxioms ZProperties DecidableClass