diff options
| author | Pierre Boutillier | 2014-09-08 16:19:39 +0200 |
|---|---|---|
| committer | Pierre Boutillier | 2014-10-01 23:24:36 +0200 |
| commit | 183112fc6a5fbb7d1c6d60b9717cdb8aceda78ca (patch) | |
| tree | 8ac0350e08c22893acbb3905e028aee18f86bb5b /theories/ZArith | |
| parent | b9a6247ddc52082065b56f296c889c41167e0507 (diff) | |
Simpl less (so that cbn will not simpl too much)
Diffstat (limited to 'theories/ZArith')
| -rw-r--r-- | theories/ZArith/Zlogarithm.v | 2 | ||||
| -rw-r--r-- | theories/ZArith/Zpow_facts.v | 4 |
2 files changed, 2 insertions, 4 deletions
diff --git a/theories/ZArith/Zlogarithm.v b/theories/ZArith/Zlogarithm.v index 319e2c269f..23b6920226 100644 --- a/theories/ZArith/Zlogarithm.v +++ b/theories/ZArith/Zlogarithm.v @@ -59,7 +59,7 @@ Section Log_pos. (* Log of positive integers *) Lemma Zlog2_up_log_sup : forall p, Z.log2_up (Zpos p) = log_sup p. Proof. - induction p; simpl. + induction p; simpl log_sup. - change (Zpos p~1) with (2*(Zpos p)+1). rewrite Z.log2_up_succ_double, Zlog2_log_inf; try easy. unfold Z.succ. now rewrite !(Z.add_comm _ 1), Z.add_assoc. diff --git a/theories/ZArith/Zpow_facts.v b/theories/ZArith/Zpow_facts.v index 8ff641a332..5b0e3ef5ee 100644 --- a/theories/ZArith/Zpow_facts.v +++ b/theories/ZArith/Zpow_facts.v @@ -152,10 +152,8 @@ Qed. Theorem Zpow_mod_correct a m n : n <> 0 -> Zpow_mod a m n = (a ^ m) mod n. Proof. - intros Hn. destruct m; simpl. - - trivial. + intros Hn. destruct m; simpl; trivial. - apply Zpow_mod_pos_correct; auto with zarith. - - rewrite Z.mod_0_l; auto with zarith. Qed. (* Complements about power and number theory. *) |