@@ -39,7 +39,7 @@ the economic rights, and the successive licensors have only limited
3939liability. See the COPYING file for more details.
4040 *)
4141
42- Set SsrOldRewriteGoalsOrder. (* change Set to Unset when porting the file, then remove the line when requiring MathComp >= 2.6 *)
42+ Unset SsrOldRewriteGoalsOrder. (* remove the line when requiring MathComp >= 2.6 *)
4343Set Implicit Arguments .
4444Unset Strict Implicit .
4545Unset Printing Implicit Defensive.
@@ -284,7 +284,7 @@ apply/RltbP/Rabs_def1.
284284 apply: (Rlt_le_trans _ (IZR (up x)))=> //.
285285 elim/(well_founded_ind (Zwf_well_founded 0)): (up x) => z IHz.
286286 case: (Z_lt_le_dec 0 z) => [zp | zn].
287- rewrite [z]Hz plus_IZR Zabs_nat_Zplus //; last exact: Zlt_0_le_0_pred.
287+ rewrite [z]Hz plus_IZR Zabs_nat_Zplus //; first exact: Zlt_0_le_0_pred.
288288 rewrite plusE mulrnDr.
289289 apply/Rplus_le_compat_r/IHz; split; first exact: Zlt_le_weak.
290290 exact: Zlt_pred.
@@ -296,7 +296,7 @@ apply: (Rlt_le_trans _ (IZR (up x) - 1)).
296296 elim/(well_founded_ind (Zwf_well_founded 0)): (- up x)%Z => z IHz .
297297 case: (Z_lt_le_dec 0 z) => [zp | zn].
298298 rewrite [z]Hz Zabs_nat_Zopp plus_IZR.
299- rewrite Zabs_nat_Zplus //; last exact: Zlt_0_le_0_pred.
299+ rewrite Zabs_nat_Zplus //; first exact: Zlt_0_le_0_pred.
300300 rewrite plusE -Rplus_assoc -addnA [(_ + 2)%N]addnC addnA mulrnDr.
301301 apply: Rplus_lt_compat_r; rewrite -Zabs_nat_Zopp.
302302 apply: IHz; split; first exact: Zlt_le_weak.
@@ -503,7 +503,7 @@ Proof. by rewrite -Pos_to_natE INR_IPR. Qed.
503503Let ge0_RsqrtE x : 0 <= x -> sqrt x = Num.sqrt x.
504504Proof .
505505move => x0; apply/eqP; have [t1 t2] := conj (sqrtr_ge0 x) (sqrt_pos x).
506- rewrite eq_sym -(eqrXn2 (_: 0 < 2)%N t1) //; last exact/RleP.
506+ rewrite eq_sym -(eqrXn2 (_: 0 < 2)%N t1) //; first exact/RleP.
507507by rewrite sqr_sqrtr // !exprS expr0 mulr1 -RmultE ?sqrt_sqrt //; exact/RleP.
508508Qed .
509509
@@ -584,10 +584,10 @@ Proof.
584584#[warning="-deprecated"]
585585rewrite (_ : bigmaxr _ _ = if s isn't h :: t then r else \big[Num.max/h]_(i <- s) i).
586586 #[warning="-deprecated"]
587- case: s => // ? t; rewrite big_cons /bigmaxr.
588- by elim: t => //= [|? ? <-]; [rewrite big_nil maxxx | rewrite big_cons maxCA].
587+ by case: s => //=; rewrite /bigmaxr big_nil.
589588#[warning="-deprecated"]
590- by case: s => //=; rewrite /bigmaxr big_nil.
589+ case: s => // ? t; rewrite big_cons /bigmaxr.
590+ by elim: t => //= [|? ? <-]; [rewrite big_nil maxxx | rewrite big_cons maxCA].
591591Qed .
592592
593593#[deprecated(note="To be removed. Use order.v's bigmax/min lemmas instead.")]
@@ -753,7 +753,7 @@ Lemma bmaxrf_index n (f : {ffun 'I_n.+1 -> R}) :
753753Proof .
754754#[warning="-deprecated"]
755755rewrite /bmaxrf.
756- rewrite [in X in (_ < X)%N](_ : n.+1 = size (codom f)); last first .
756+ rewrite [in X in (_ < X)%N](_ : n.+1 = size (codom f)).
757757 by rewrite size_codom card_ord.
758758#[warning="-deprecated"]
759759by apply: bigmaxr_index; rewrite size_codom card_ord.
@@ -777,9 +777,9 @@ move: (bmaxrf_index f).
777777rewrite -[X in _ (_ < X)%N]card_ord -(size_codom f) index_mem.
778778move/(nth_index (f ord0)) => <-; rewrite (nth_map ord0).
779779 #[warning="-deprecated"]
780- by rewrite (ordnat (bmaxrf_index _)) /index_bmaxrf nth_ord_enum .
780+ by rewrite size_enum_ord; apply: bmaxrf_index .
781781#[warning="-deprecated"]
782- by rewrite size_enum_ord; apply: bmaxrf_index.
782+ by rewrite (ordnat ( bmaxrf_index _)) /index_bmaxrf nth_ord_enum .
783783Qed .
784784
785785#[deprecated(note="To be removed. Use order.v's bigmax/min lemmas instead.")]
0 commit comments