proposition: Lemma eqA_dec : forall x y, {eqA x y}+{~eqA x y}.
proof: Proof. unfold eqA. unfold BigN.eq. intros. apply (dec_beq beq_Z_ok). Defined.
imports: Coq(Relations Arith Compare Bool Setoid Morphisms) CoLoR(RelDec LogicUtil RelExtras EqUtil NatUtil ZUtil) Bignums(BigN)