From a06d61a8e226eeabc52f1a22e469dca1e6077065 Mon Sep 17 00:00:00 2001
From: Kazuhiko Sakaguchi
Date: Fri, 29 Nov 2019 01:19:33 +0900
Subject: Refactoring and linting especially polydiv

- Replace `altP eqP` and `altP (_ =P _)` with `eqVneq`:
  The improved `eqVneq` lemma (#351) is redesigned as a comparison predicate and
  introduces a hypothesis in the form of `x != y` in the second case. Thus,
  `case: (altP eqP)`, `case: (altP (x =P _))` and `case: (altP (x =P y))` idioms
  can be replaced with `case: eqVneq`, `case: (eqVneq x)` and
  `case: (eqVneq x y)` respectively. This replacement slightly simplifies and
  reduces proof scripts.
- use `have [] :=` rather than `case` if it is better.
- `by apply:` -> `exact:`.
- `apply/lem1; apply/lem2` or `apply: lem1; apply: lem2` -> `apply/lem1/lem2`.
- `move/lem1; move/lem2` -> `move/lem1/lem2`.
- Remove `GRing.` prefix if applicable.
- `negbTE` -> `negPf`, `eq_refl` -> `eqxx` and `sym_equal` -> `esym`.
---
 mathcomp/fingroup/perm.v | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'mathcomp/fingroup')

diff --git a/mathcomp/fingroup/perm.v b/mathcomp/fingroup/perm.v
index b35ab1d..34f230e 100644
--- a/mathcomp/fingroup/perm.v
+++ b/mathcomp/fingroup/perm.v
@@ -475,7 +475,7 @@ have [|ts def_s ne_ts] := IHn (tperm x (s^-1 x) * s); last first.
 rewrite (cardD1 x) !inE s_x in le_s_n; apply: leq_ltn_trans le_s_n.
 apply: subset_leq_card; apply/subsetP=> y.
 rewrite !inE permM permE /= -(canF_eq (permK _)).
-have [-> | ne_yx] := altP (y =P x); first by rewrite permKV eqxx.
+have [-> | ne_yx] := eqVneq y x; first by rewrite permKV eqxx.
 by case: (s y =P x) => // -> _; rewrite eq_sym.
 Qed.
 
-- 
cgit v1.2.3