![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > sylow3 | Structured version Visualization version GIF version |
Description: Sylow's third theorem. The number of Sylow subgroups is a divisor of ∣ 𝐺 ∣ / 𝑑, where 𝑑 is the common order of a Sylow subgroup, and is equivalent to 1 mod 𝑃. This is part of Metamath 100 proof #72. (Contributed by Mario Carneiro, 19-Jan-2015.) |
Ref | Expression |
---|---|
sylow3.x | ⊢ 𝑋 = (Base‘𝐺) |
sylow3.g | ⊢ (𝜑 → 𝐺 ∈ Grp) |
sylow3.xf | ⊢ (𝜑 → 𝑋 ∈ Fin) |
sylow3.p | ⊢ (𝜑 → 𝑃 ∈ ℙ) |
sylow3.n | ⊢ 𝑁 = (♯‘(𝑃 pSyl 𝐺)) |
Ref | Expression |
---|---|
sylow3 | ⊢ (𝜑 → (𝑁 ∥ ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋)))) ∧ (𝑁 mod 𝑃) = 1)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sylow3.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ Grp) | |
2 | sylow3.xf | . . . 4 ⊢ (𝜑 → 𝑋 ∈ Fin) | |
3 | sylow3.p | . . . 4 ⊢ (𝜑 → 𝑃 ∈ ℙ) | |
4 | sylow3.x | . . . . 5 ⊢ 𝑋 = (Base‘𝐺) | |
5 | 4 | slwn0 18236 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) → (𝑃 pSyl 𝐺) ≠ ∅) |
6 | 1, 2, 3, 5 | syl3anc 1476 | . . 3 ⊢ (𝜑 → (𝑃 pSyl 𝐺) ≠ ∅) |
7 | n0 4079 | . . 3 ⊢ ((𝑃 pSyl 𝐺) ≠ ∅ ↔ ∃𝑘 𝑘 ∈ (𝑃 pSyl 𝐺)) | |
8 | 6, 7 | sylib 208 | . 2 ⊢ (𝜑 → ∃𝑘 𝑘 ∈ (𝑃 pSyl 𝐺)) |
9 | sylow3.n | . . . 4 ⊢ 𝑁 = (♯‘(𝑃 pSyl 𝐺)) | |
10 | 1 | adantr 466 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑃 pSyl 𝐺)) → 𝐺 ∈ Grp) |
11 | 2 | adantr 466 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑃 pSyl 𝐺)) → 𝑋 ∈ Fin) |
12 | 3 | adantr 466 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑃 pSyl 𝐺)) → 𝑃 ∈ ℙ) |
13 | eqid 2771 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
14 | eqid 2771 | . . . . 5 ⊢ (-g‘𝐺) = (-g‘𝐺) | |
15 | oveq2 6803 | . . . . . . . . . 10 ⊢ (𝑐 = 𝑧 → (𝑎(+g‘𝐺)𝑐) = (𝑎(+g‘𝐺)𝑧)) | |
16 | 15 | oveq1d 6810 | . . . . . . . . 9 ⊢ (𝑐 = 𝑧 → ((𝑎(+g‘𝐺)𝑐)(-g‘𝐺)𝑎) = ((𝑎(+g‘𝐺)𝑧)(-g‘𝐺)𝑎)) |
17 | 16 | cbvmptv 4885 | . . . . . . . 8 ⊢ (𝑐 ∈ 𝑏 ↦ ((𝑎(+g‘𝐺)𝑐)(-g‘𝐺)𝑎)) = (𝑧 ∈ 𝑏 ↦ ((𝑎(+g‘𝐺)𝑧)(-g‘𝐺)𝑎)) |
18 | oveq1 6802 | . . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → (𝑎(+g‘𝐺)𝑧) = (𝑥(+g‘𝐺)𝑧)) | |
19 | id 22 | . . . . . . . . . 10 ⊢ (𝑎 = 𝑥 → 𝑎 = 𝑥) | |
20 | 18, 19 | oveq12d 6813 | . . . . . . . . 9 ⊢ (𝑎 = 𝑥 → ((𝑎(+g‘𝐺)𝑧)(-g‘𝐺)𝑎) = ((𝑥(+g‘𝐺)𝑧)(-g‘𝐺)𝑥)) |
21 | 20 | mpteq2dv 4880 | . . . . . . . 8 ⊢ (𝑎 = 𝑥 → (𝑧 ∈ 𝑏 ↦ ((𝑎(+g‘𝐺)𝑧)(-g‘𝐺)𝑎)) = (𝑧 ∈ 𝑏 ↦ ((𝑥(+g‘𝐺)𝑧)(-g‘𝐺)𝑥))) |
22 | 17, 21 | syl5eq 2817 | . . . . . . 7 ⊢ (𝑎 = 𝑥 → (𝑐 ∈ 𝑏 ↦ ((𝑎(+g‘𝐺)𝑐)(-g‘𝐺)𝑎)) = (𝑧 ∈ 𝑏 ↦ ((𝑥(+g‘𝐺)𝑧)(-g‘𝐺)𝑥))) |
23 | 22 | rneqd 5490 | . . . . . 6 ⊢ (𝑎 = 𝑥 → ran (𝑐 ∈ 𝑏 ↦ ((𝑎(+g‘𝐺)𝑐)(-g‘𝐺)𝑎)) = ran (𝑧 ∈ 𝑏 ↦ ((𝑥(+g‘𝐺)𝑧)(-g‘𝐺)𝑥))) |
24 | mpteq1 4872 | . . . . . . 7 ⊢ (𝑏 = 𝑦 → (𝑧 ∈ 𝑏 ↦ ((𝑥(+g‘𝐺)𝑧)(-g‘𝐺)𝑥)) = (𝑧 ∈ 𝑦 ↦ ((𝑥(+g‘𝐺)𝑧)(-g‘𝐺)𝑥))) | |
25 | 24 | rneqd 5490 | . . . . . 6 ⊢ (𝑏 = 𝑦 → ran (𝑧 ∈ 𝑏 ↦ ((𝑥(+g‘𝐺)𝑧)(-g‘𝐺)𝑥)) = ran (𝑧 ∈ 𝑦 ↦ ((𝑥(+g‘𝐺)𝑧)(-g‘𝐺)𝑥))) |
26 | 23, 25 | cbvmpt2v 6885 | . . . . 5 ⊢ (𝑎 ∈ 𝑋, 𝑏 ∈ (𝑃 pSyl 𝐺) ↦ ran (𝑐 ∈ 𝑏 ↦ ((𝑎(+g‘𝐺)𝑐)(-g‘𝐺)𝑎))) = (𝑥 ∈ 𝑋, 𝑦 ∈ (𝑃 pSyl 𝐺) ↦ ran (𝑧 ∈ 𝑦 ↦ ((𝑥(+g‘𝐺)𝑧)(-g‘𝐺)𝑥))) |
27 | simpr 471 | . . . . 5 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑃 pSyl 𝐺)) → 𝑘 ∈ (𝑃 pSyl 𝐺)) | |
28 | eqid 2771 | . . . . 5 ⊢ {𝑢 ∈ 𝑋 ∣ (𝑢(𝑎 ∈ 𝑋, 𝑏 ∈ (𝑃 pSyl 𝐺) ↦ ran (𝑐 ∈ 𝑏 ↦ ((𝑎(+g‘𝐺)𝑐)(-g‘𝐺)𝑎)))𝑘) = 𝑘} = {𝑢 ∈ 𝑋 ∣ (𝑢(𝑎 ∈ 𝑋, 𝑏 ∈ (𝑃 pSyl 𝐺) ↦ ran (𝑐 ∈ 𝑏 ↦ ((𝑎(+g‘𝐺)𝑐)(-g‘𝐺)𝑎)))𝑘) = 𝑘} | |
29 | eqid 2771 | . . . . 5 ⊢ {𝑥 ∈ 𝑋 ∣ ∀𝑦 ∈ 𝑋 ((𝑥(+g‘𝐺)𝑦) ∈ 𝑘 ↔ (𝑦(+g‘𝐺)𝑥) ∈ 𝑘)} = {𝑥 ∈ 𝑋 ∣ ∀𝑦 ∈ 𝑋 ((𝑥(+g‘𝐺)𝑦) ∈ 𝑘 ↔ (𝑦(+g‘𝐺)𝑥) ∈ 𝑘)} | |
30 | 4, 10, 11, 12, 13, 14, 26, 27, 28, 29 | sylow3lem4 18251 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑃 pSyl 𝐺)) → (♯‘(𝑃 pSyl 𝐺)) ∥ ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋))))) |
31 | 9, 30 | syl5eqbr 4822 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑃 pSyl 𝐺)) → 𝑁 ∥ ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋))))) |
32 | 9 | oveq1i 6805 | . . . 4 ⊢ (𝑁 mod 𝑃) = ((♯‘(𝑃 pSyl 𝐺)) mod 𝑃) |
33 | 23, 25 | cbvmpt2v 6885 | . . . . 5 ⊢ (𝑎 ∈ 𝑘, 𝑏 ∈ (𝑃 pSyl 𝐺) ↦ ran (𝑐 ∈ 𝑏 ↦ ((𝑎(+g‘𝐺)𝑐)(-g‘𝐺)𝑎))) = (𝑥 ∈ 𝑘, 𝑦 ∈ (𝑃 pSyl 𝐺) ↦ ran (𝑧 ∈ 𝑦 ↦ ((𝑥(+g‘𝐺)𝑧)(-g‘𝐺)𝑥))) |
34 | eqid 2771 | . . . . 5 ⊢ {𝑥 ∈ 𝑋 ∣ ∀𝑦 ∈ 𝑋 ((𝑥(+g‘𝐺)𝑦) ∈ 𝑠 ↔ (𝑦(+g‘𝐺)𝑥) ∈ 𝑠)} = {𝑥 ∈ 𝑋 ∣ ∀𝑦 ∈ 𝑋 ((𝑥(+g‘𝐺)𝑦) ∈ 𝑠 ↔ (𝑦(+g‘𝐺)𝑥) ∈ 𝑠)} | |
35 | 4, 10, 11, 12, 13, 14, 27, 33, 34 | sylow3lem6 18253 | . . . 4 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑃 pSyl 𝐺)) → ((♯‘(𝑃 pSyl 𝐺)) mod 𝑃) = 1) |
36 | 32, 35 | syl5eq 2817 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑃 pSyl 𝐺)) → (𝑁 mod 𝑃) = 1) |
37 | 31, 36 | jca 501 | . 2 ⊢ ((𝜑 ∧ 𝑘 ∈ (𝑃 pSyl 𝐺)) → (𝑁 ∥ ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋)))) ∧ (𝑁 mod 𝑃) = 1)) |
38 | 8, 37 | exlimddv 2015 | 1 ⊢ (𝜑 → (𝑁 ∥ ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋)))) ∧ (𝑁 mod 𝑃) = 1)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 196 ∧ wa 382 = wceq 1631 ∃wex 1852 ∈ wcel 2145 ≠ wne 2943 ∀wral 3061 {crab 3065 ∅c0 4063 class class class wbr 4787 ↦ cmpt 4864 ran crn 5251 ‘cfv 6030 (class class class)co 6795 ↦ cmpt2 6797 Fincfn 8112 1c1 10142 / cdiv 10889 mod cmo 12875 ↑cexp 13066 ♯chash 13320 ∥ cdvds 15188 ℙcprime 15591 pCnt cpc 15747 Basecbs 16063 +gcplusg 16148 Grpcgrp 17629 -gcsg 17631 pSyl cslw 18153 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1870 ax-4 1885 ax-5 1991 ax-6 2057 ax-7 2093 ax-8 2147 ax-9 2154 ax-10 2174 ax-11 2190 ax-12 2203 ax-13 2408 ax-ext 2751 ax-rep 4905 ax-sep 4916 ax-nul 4924 ax-pow 4975 ax-pr 5035 ax-un 7099 ax-inf2 8705 ax-cnex 10197 ax-resscn 10198 ax-1cn 10199 ax-icn 10200 ax-addcl 10201 ax-addrcl 10202 ax-mulcl 10203 ax-mulrcl 10204 ax-mulcom 10205 ax-addass 10206 ax-mulass 10207 ax-distr 10208 ax-i2m1 10209 ax-1ne0 10210 ax-1rid 10211 ax-rnegex 10212 ax-rrecex 10213 ax-cnre 10214 ax-pre-lttri 10215 ax-pre-lttrn 10216 ax-pre-ltadd 10217 ax-pre-mulgt0 10218 ax-pre-sup 10219 |
This theorem depends on definitions: df-bi 197 df-an 383 df-or 837 df-3or 1072 df-3an 1073 df-tru 1634 df-fal 1637 df-ex 1853 df-nf 1858 df-sb 2050 df-eu 2622 df-mo 2623 df-clab 2758 df-cleq 2764 df-clel 2767 df-nfc 2902 df-ne 2944 df-nel 3047 df-ral 3066 df-rex 3067 df-reu 3068 df-rmo 3069 df-rab 3070 df-v 3353 df-sbc 3588 df-csb 3683 df-dif 3726 df-un 3728 df-in 3730 df-ss 3737 df-pss 3739 df-nul 4064 df-if 4227 df-pw 4300 df-sn 4318 df-pr 4320 df-tp 4322 df-op 4324 df-uni 4576 df-int 4613 df-iun 4657 df-disj 4756 df-br 4788 df-opab 4848 df-mpt 4865 df-tr 4888 df-id 5158 df-eprel 5163 df-po 5171 df-so 5172 df-fr 5209 df-se 5210 df-we 5211 df-xp 5256 df-rel 5257 df-cnv 5258 df-co 5259 df-dm 5260 df-rn 5261 df-res 5262 df-ima 5263 df-pred 5822 df-ord 5868 df-on 5869 df-lim 5870 df-suc 5871 df-iota 5993 df-fun 6032 df-fn 6033 df-f 6034 df-f1 6035 df-fo 6036 df-f1o 6037 df-fv 6038 df-isom 6039 df-riota 6756 df-ov 6798 df-oprab 6799 df-mpt2 6800 df-om 7216 df-1st 7318 df-2nd 7319 df-wrecs 7562 df-recs 7624 df-rdg 7662 df-1o 7716 df-2o 7717 df-oadd 7720 df-omul 7721 df-er 7899 df-ec 7901 df-qs 7905 df-map 8014 df-en 8113 df-dom 8114 df-sdom 8115 df-fin 8116 df-sup 8507 df-inf 8508 df-oi 8574 df-card 8968 df-acn 8971 df-cda 9195 df-pnf 10281 df-mnf 10282 df-xr 10283 df-ltxr 10284 df-le 10285 df-sub 10473 df-neg 10474 df-div 10890 df-nn 11226 df-2 11284 df-3 11285 df-n0 11499 df-xnn0 11570 df-z 11584 df-uz 11893 df-q 11996 df-rp 12035 df-fz 12533 df-fzo 12673 df-fl 12800 df-mod 12876 df-seq 13008 df-exp 13067 df-fac 13264 df-bc 13293 df-hash 13321 df-cj 14046 df-re 14047 df-im 14048 df-sqrt 14182 df-abs 14183 df-clim 14426 df-sum 14624 df-dvds 15189 df-gcd 15424 df-prm 15592 df-pc 15748 df-ndx 16066 df-slot 16067 df-base 16069 df-sets 16070 df-ress 16071 df-plusg 16161 df-0g 16309 df-mgm 17449 df-sgrp 17491 df-mnd 17502 df-submnd 17543 df-grp 17632 df-minusg 17633 df-sbg 17634 df-mulg 17748 df-subg 17798 df-nsg 17799 df-eqg 17800 df-ghm 17865 df-ga 17929 df-od 18154 df-pgp 18156 df-slw 18157 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |