fact: Axiom recursion_succ : forall {A} (Aeq : relation A) (a : A) (f : t -> A -> A), Aeq a a -> Proper (eq==>Aeq==>Aeq) f -> forall n, Aeq (recursion a f (S n)) (f n (recursion a f n)).
imports: Bool NZAxioms NZParity NZPow NZSqrt NZLog NZDiv NZGcd NZBits