proposition: Lemma power_algo : forall n : nat, 0 < n -> addchain_spec n.
proof: Proof. intros; split. apply chain_algo. simpl in |- *; auto with arith. Qed.
imports: monoid spec Constants machine Euclid Le_lt_compl euclid shift two_power log2_spec develop Arith Peano_dec Compare_dec strategies Mult_compl Wf_nat Wf_compl