![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > sylow2 | Structured version Visualization version GIF version |
Description: Sylow's second theorem. See also sylow2b 19419 for the "hard" part of the proof. Any two Sylow 𝑃-subgroups are conjugate to one another, and hence the same size, namely 𝑃↑(𝑃 pCnt ∣ 𝑋 ∣ ) (see fislw 19421). This is part of Metamath 100 proof #72. (Contributed by Mario Carneiro, 18-Jan-2015.) |
Ref | Expression |
---|---|
sylow2.x | ⊢ 𝑋 = (Base‘𝐺) |
sylow2.f | ⊢ (𝜑 → 𝑋 ∈ Fin) |
sylow2.h | ⊢ (𝜑 → 𝐻 ∈ (𝑃 pSyl 𝐺)) |
sylow2.k | ⊢ (𝜑 → 𝐾 ∈ (𝑃 pSyl 𝐺)) |
sylow2.a | ⊢ + = (+g‘𝐺) |
sylow2.d | ⊢ − = (-g‘𝐺) |
Ref | Expression |
---|---|
sylow2 | ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | sylow2.f | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ Fin) | |
2 | 1 | adantr 481 | . . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝑋 ∈ Fin) |
3 | sylow2.k | . . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ (𝑃 pSyl 𝐺)) | |
4 | slwsubg 19406 | . . . . . . 7 ⊢ (𝐾 ∈ (𝑃 pSyl 𝐺) → 𝐾 ∈ (SubGrp‘𝐺)) | |
5 | 3, 4 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (SubGrp‘𝐺)) |
6 | simprl 769 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝑔 ∈ 𝑋) | |
7 | sylow2.x | . . . . . . 7 ⊢ 𝑋 = (Base‘𝐺) | |
8 | sylow2.a | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
9 | sylow2.d | . . . . . . 7 ⊢ − = (-g‘𝐺) | |
10 | eqid 2731 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) = (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) | |
11 | 7, 8, 9, 10 | conjsubg 19054 | . . . . . 6 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ 𝑔 ∈ 𝑋) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺)) |
12 | 5, 6, 11 | syl2an2r 683 | . . . . 5 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺)) |
13 | 7 | subgss 18943 | . . . . 5 ⊢ (ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋) |
14 | 12, 13 | syl 17 | . . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋) |
15 | 2, 14 | ssfid 9218 | . . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin) |
16 | simprr 771 | . . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) | |
17 | sylow2.h | . . . . . . 7 ⊢ (𝜑 → 𝐻 ∈ (𝑃 pSyl 𝐺)) | |
18 | 7, 1, 17 | slwhash 19420 | . . . . . 6 ⊢ (𝜑 → (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))) |
19 | 7, 1, 3 | slwhash 19420 | . . . . . 6 ⊢ (𝜑 → (♯‘𝐾) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))) |
20 | 18, 19 | eqtr4d 2774 | . . . . 5 ⊢ (𝜑 → (♯‘𝐻) = (♯‘𝐾)) |
21 | slwsubg 19406 | . . . . . . . . 9 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝐻 ∈ (SubGrp‘𝐺)) | |
22 | 17, 21 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝐻 ∈ (SubGrp‘𝐺)) |
23 | 7 | subgss 18943 | . . . . . . . 8 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋) |
24 | 22, 23 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐻 ⊆ 𝑋) |
25 | 1, 24 | ssfid 9218 | . . . . . 6 ⊢ (𝜑 → 𝐻 ∈ Fin) |
26 | 7 | subgss 18943 | . . . . . . . 8 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → 𝐾 ⊆ 𝑋) |
27 | 5, 26 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐾 ⊆ 𝑋) |
28 | 1, 27 | ssfid 9218 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ Fin) |
29 | hashen 14257 | . . . . . 6 ⊢ ((𝐻 ∈ Fin ∧ 𝐾 ∈ Fin) → ((♯‘𝐻) = (♯‘𝐾) ↔ 𝐻 ≈ 𝐾)) | |
30 | 25, 28, 29 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → ((♯‘𝐻) = (♯‘𝐾) ↔ 𝐻 ≈ 𝐾)) |
31 | 20, 30 | mpbid 231 | . . . 4 ⊢ (𝜑 → 𝐻 ≈ 𝐾) |
32 | 7, 8, 9, 10 | conjsubgen 19055 | . . . . 5 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ 𝑔 ∈ 𝑋) → 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
33 | 5, 6, 32 | syl2an2r 683 | . . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
34 | entr 8953 | . . . 4 ⊢ ((𝐻 ≈ 𝐾 ∧ 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) → 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) | |
35 | 31, 33, 34 | syl2an2r 683 | . . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
36 | fisseneq 9208 | . . 3 ⊢ ((ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∧ 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) → 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) | |
37 | 15, 16, 35, 36 | syl3anc 1371 | . 2 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
38 | eqid 2731 | . . . . 5 ⊢ (𝐺 ↾s 𝐻) = (𝐺 ↾s 𝐻) | |
39 | 38 | slwpgp 19409 | . . . 4 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝑃 pGrp (𝐺 ↾s 𝐻)) |
40 | 17, 39 | syl 17 | . . 3 ⊢ (𝜑 → 𝑃 pGrp (𝐺 ↾s 𝐻)) |
41 | 7, 1, 22, 5, 8, 40, 19, 9 | sylow2b 19419 | . 2 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
42 | 37, 41 | reximddv 3164 | 1 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∃wrex 3069 ⊆ wss 3913 class class class wbr 5110 ↦ cmpt 5193 ran crn 5639 ‘cfv 6501 (class class class)co 7362 ≈ cen 8887 Fincfn 8890 ↑cexp 13977 ♯chash 14240 pCnt cpc 16719 Basecbs 17094 ↾s cress 17123 +gcplusg 17147 -gcsg 18764 SubGrpcsubg 18936 pGrp cpgp 19322 pSyl cslw 19323 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2702 ax-rep 5247 ax-sep 5261 ax-nul 5268 ax-pow 5325 ax-pr 5389 ax-un 7677 ax-inf2 9586 ax-cnex 11116 ax-resscn 11117 ax-1cn 11118 ax-icn 11119 ax-addcl 11120 ax-addrcl 11121 ax-mulcl 11122 ax-mulrcl 11123 ax-mulcom 11124 ax-addass 11125 ax-mulass 11126 ax-distr 11127 ax-i2m1 11128 ax-1ne0 11129 ax-1rid 11130 ax-rnegex 11131 ax-rrecex 11132 ax-cnre 11133 ax-pre-lttri 11134 ax-pre-lttrn 11135 ax-pre-ltadd 11136 ax-pre-mulgt0 11137 ax-pre-sup 11138 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3351 df-reu 3352 df-rab 3406 df-v 3448 df-sbc 3743 df-csb 3859 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3932 df-nul 4288 df-if 4492 df-pw 4567 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-int 4913 df-iun 4961 df-disj 5076 df-br 5111 df-opab 5173 df-mpt 5194 df-tr 5228 df-id 5536 df-eprel 5542 df-po 5550 df-so 5551 df-fr 5593 df-se 5594 df-we 5595 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6258 df-ord 6325 df-on 6326 df-lim 6327 df-suc 6328 df-iota 6453 df-fun 6503 df-fn 6504 df-f 6505 df-f1 6506 df-fo 6507 df-f1o 6508 df-fv 6509 df-isom 6510 df-riota 7318 df-ov 7365 df-oprab 7366 df-mpo 7367 df-om 7808 df-1st 7926 df-2nd 7927 df-frecs 8217 df-wrecs 8248 df-recs 8322 df-rdg 8361 df-1o 8417 df-2o 8418 df-oadd 8421 df-omul 8422 df-er 8655 df-ec 8657 df-qs 8661 df-map 8774 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-sup 9387 df-inf 9388 df-oi 9455 df-dju 9846 df-card 9884 df-acn 9887 df-pnf 11200 df-mnf 11201 df-xr 11202 df-ltxr 11203 df-le 11204 df-sub 11396 df-neg 11397 df-div 11822 df-nn 12163 df-2 12225 df-3 12226 df-n0 12423 df-xnn0 12495 df-z 12509 df-uz 12773 df-q 12883 df-rp 12925 df-fz 13435 df-fzo 13578 df-fl 13707 df-mod 13785 df-seq 13917 df-exp 13978 df-fac 14184 df-bc 14213 df-hash 14241 df-cj 14996 df-re 14997 df-im 14998 df-sqrt 15132 df-abs 15133 df-clim 15382 df-sum 15583 df-dvds 16148 df-gcd 16386 df-prm 16559 df-pc 16720 df-sets 17047 df-slot 17065 df-ndx 17077 df-base 17095 df-ress 17124 df-plusg 17160 df-0g 17337 df-mgm 18511 df-sgrp 18560 df-mnd 18571 df-submnd 18616 df-grp 18765 df-minusg 18766 df-sbg 18767 df-mulg 18887 df-subg 18939 df-eqg 18941 df-ghm 19020 df-ga 19084 df-od 19324 df-pgp 19326 df-slw 19327 |
This theorem is referenced by: sylow3lem3 19425 sylow3lem6 19428 |
Copyright terms: Public domain | W3C validator |