proposition: Theorem succ_pred: forall q : bigN, 0 < q -> BigN.succ (BigN.pred q) == q.
proof: Proof. intros; apply BigN.succ_pred. intro H'; rewrite H' in H; discriminate. Qed.
imports: Lia CyclicAxioms Ring63 NSig NSigNAxioms NMake NProperties GenericMinMax