diff options
| author |  Pierre Boutillier <pierre.boutillier@ens-lyon.org> | 2014-04-25 16:17:15 +0200 |
|---|---|---|
| committer | Pierre Boutillier <pierre.boutillier@ens-lyon.org> | 2014-05-02 11:05:19 +0200 |
| commit | 1432318faa4cb6a50eca2c7a371b43b3b9969666 (patch) | |
| tree | 694d6a8266ec1aad5f0439cfb0a3fa41fb8fd270 /theories/PArith/Pnat.v | |
| parent | c3e091756e0030e29e231ca1d7c3bd12ded55760 (diff) | |
Pos.iter arguments in a better order for cbn.
Diffstat (limited to 'theories/PArith/Pnat.v')
| -rw-r--r-- | theories/PArith/Pnat.v | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/theories/PArith/Pnat.v b/theories/PArith/Pnat.v index 12042f76c..9ce399beb 100644 --- a/theories/PArith/Pnat.v +++ b/theories/PArith/Pnat.v @@ -192,7 +192,7 @@ Qed. Theorem inj_iter : forall p {A} (f:A->A) (x:A), - Pos.iter p f x = nat_rect (fun _ => A) x (fun _ => f) (to_nat p). + Pos.iter f x p = nat_rect (fun _ => A) x (fun _ => f) (to_nat p). Proof. induction p using peano_ind. trivial. intros. rewrite inj_succ, iter_succ. simpl. now f_equal. |