proposition: Theorem Zmod_minus_one: forall a1 b1, 0 < b1 -> (a1 - b1) mod b1 = a1 mod b1.
proof: Proof. intros a1 b1 H; rewrite Zminus_mod; auto with zarith. rewrite Z_mod_same; try rewrite Zminus_0_r; auto with zarith. apply Zmod_mod; auto. Qed.
imports: Bignums(DoubleBase DoubleSub DoubleMul DoubleSqrt DoubleLift DoubleDivn1 DoubleDiv) Bignums(DoubleCyclic BigN) CyclicAxioms Cyclic63 ZArith ZCAux