aboutsummaryrefslogtreecommitdiff
path: root/mathcomp/solvable/extremal.v
diff options
context:
space:
mode:
authorChristian Doczkal2020-09-10 17:45:57 +0200
committerChristian Doczkal2020-09-29 11:10:31 +0200
commit298830c5a3860c7a645df6effe7d1cc228d56150 (patch)
treea9a97a1ba6abd46f94d5ca48ece171cc9d88df2f /mathcomp/solvable/extremal.v
parent7a34bf388b368b450f20a7e10e5a3076370d2d52 (diff)
rename mem_imset to imset_f (with deprecation)
Diffstat (limited to 'mathcomp/solvable/extremal.v')
-rw-r--r--mathcomp/solvable/extremal.v8
1 files changed, 4 insertions, 4 deletions
diff --git a/mathcomp/solvable/extremal.v b/mathcomp/solvable/extremal.v
index 42882bc..8185773 100644
--- a/mathcomp/solvable/extremal.v
+++ b/mathcomp/solvable/extremal.v
@@ -792,7 +792,7 @@ have defK: K = [set w].
rewrite add0n -[j./2]odd_double_half addnC doubleD -!muln2 -mulnA.
rewrite -(expg_mod_order v) ov modnMDl; case: (odd _); last first.
right; rewrite mulg1 /r -(subnKC n_gt2) expnSr mulnA expgM.
- by apply: mem_imset; rewrite inE.
+ by apply: imset_f; rewrite inE.
rewrite (inj_eq (mulIg _)) -expg_mod_order ou -[k]odd_double_half.
rewrite addnC -muln2 mulnDl -mulnA def2r modnMDl -ou expg_mod_order.
case: (odd k); [left | right]; rewrite ?mul1n ?mul1g //.
@@ -996,7 +996,7 @@ have defG': G^`(1) = <[x ^+ 2]>.
by rewrite -def2q -def2r mulnA mulnK.
have defG1: 'Mho^1(G) = <[x ^+ 2]>.
apply/eqP; rewrite (MhoE _ pG) eqEsubset !gen_subG sub1set andbC.
- rewrite mem_gen; last exact: mem_imset.
+ rewrite mem_gen; last exact: imset_f.
apply/subsetP=> z2; case/imsetP=> z Gz ->{z2}.
case Xz: (z \in X); last by rewrite -{1}(oX' z) ?expg_order ?group1 // inE Xz.
by case/cycleP: Xz => i ->; rewrite expgAC mem_cycle.
@@ -1195,7 +1195,7 @@ have defG': G^`(1) = <[x ^+ 2]>.
by rewrite -def2q -def2r mulnA mulnK.
have defG1: 'Mho^1(G) = <[x ^+ 2]>.
apply/eqP; rewrite (MhoE _ pG) eqEsubset !gen_subG sub1set andbC.
- rewrite mem_gen; last exact: mem_imset.
+ rewrite mem_gen; last exact: imset_f.
apply/subsetP=> z2; case/imsetP=> z Gz ->{z2}.
case Xz: (z \in X).
by case/cycleP: Xz => i ->; rewrite -expgM mulnC expgM mem_cycle.
@@ -1373,7 +1373,7 @@ have defG': G^`(1) = <[x ^+ 2]>.
by rewrite -def2q -def2r mulnA mulnK.
have defG1: 'Mho^1(G) = <[x ^+ 2]>.
apply/eqP; rewrite (MhoE _ pG) eqEsubset !gen_subG sub1set andbC.
- rewrite mem_gen; last exact: mem_imset.
+ rewrite mem_gen; last exact: imset_f.
apply/subsetP=> z2; case/imsetP=> z Gz ->{z2}.
case Xz: (z \in X).
by case/cycleP: Xz => i ->; rewrite -expgM mulnC expgM mem_cycle.