| 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 19552 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 19554). 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 480 | . . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝑋 ∈ Fin) |
| 3 | sylow2.k | . . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ (𝑃 pSyl 𝐺)) | |
| 4 | slwsubg 19539 | . . . . . . 7 ⊢ (𝐾 ∈ (𝑃 pSyl 𝐺) → 𝐾 ∈ (SubGrp‘𝐺)) | |
| 5 | 3, 4 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (SubGrp‘𝐺)) |
| 6 | simprl 770 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝑔 ∈ 𝑋) | |
| 7 | sylow2.x | . . . . . . 7 ⊢ 𝑋 = (Base‘𝐺) | |
| 8 | sylow2.a | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
| 9 | sylow2.d | . . . . . . 7 ⊢ − = (-g‘𝐺) | |
| 10 | eqid 2736 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) = (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) | |
| 11 | 7, 8, 9, 10 | conjsubg 19179 | . . . . . 6 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ 𝑔 ∈ 𝑋) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺)) |
| 12 | 5, 6, 11 | syl2an2r 685 | . . . . 5 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺)) |
| 13 | 7 | subgss 19057 | . . . . 5 ⊢ (ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋) |
| 14 | 12, 13 | syl 17 | . . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋) |
| 15 | 2, 14 | ssfid 9169 | . . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin) |
| 16 | simprr 772 | . . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) | |
| 17 | sylow2.h | . . . . . . 7 ⊢ (𝜑 → 𝐻 ∈ (𝑃 pSyl 𝐺)) | |
| 18 | 7, 1, 17 | slwhash 19553 | . . . . . 6 ⊢ (𝜑 → (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))) |
| 19 | 7, 1, 3 | slwhash 19553 | . . . . . 6 ⊢ (𝜑 → (♯‘𝐾) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))) |
| 20 | 18, 19 | eqtr4d 2774 | . . . . 5 ⊢ (𝜑 → (♯‘𝐻) = (♯‘𝐾)) |
| 21 | slwsubg 19539 | . . . . . . . . 9 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝐻 ∈ (SubGrp‘𝐺)) | |
| 22 | 17, 21 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝐻 ∈ (SubGrp‘𝐺)) |
| 23 | 7 | subgss 19057 | . . . . . . . 8 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋) |
| 24 | 22, 23 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐻 ⊆ 𝑋) |
| 25 | 1, 24 | ssfid 9169 | . . . . . 6 ⊢ (𝜑 → 𝐻 ∈ Fin) |
| 26 | 7 | subgss 19057 | . . . . . . . 8 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → 𝐾 ⊆ 𝑋) |
| 27 | 5, 26 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐾 ⊆ 𝑋) |
| 28 | 1, 27 | ssfid 9169 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ Fin) |
| 29 | hashen 14270 | . . . . . 6 ⊢ ((𝐻 ∈ Fin ∧ 𝐾 ∈ Fin) → ((♯‘𝐻) = (♯‘𝐾) ↔ 𝐻 ≈ 𝐾)) | |
| 30 | 25, 28, 29 | syl2anc 584 | . . . . 5 ⊢ (𝜑 → ((♯‘𝐻) = (♯‘𝐾) ↔ 𝐻 ≈ 𝐾)) |
| 31 | 20, 30 | mpbid 232 | . . . 4 ⊢ (𝜑 → 𝐻 ≈ 𝐾) |
| 32 | 7, 8, 9, 10 | conjsubgen 19180 | . . . . 5 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ 𝑔 ∈ 𝑋) → 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 33 | 5, 6, 32 | syl2an2r 685 | . . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 34 | entr 8943 | . . . 4 ⊢ ((𝐻 ≈ 𝐾 ∧ 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) → 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) | |
| 35 | 31, 33, 34 | syl2an2r 685 | . . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 36 | fisseneq 9163 | . . 3 ⊢ ((ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∧ 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) → 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) | |
| 37 | 15, 16, 35, 36 | syl3anc 1373 | . 2 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 38 | eqid 2736 | . . . . 5 ⊢ (𝐺 ↾s 𝐻) = (𝐺 ↾s 𝐻) | |
| 39 | 38 | slwpgp 19542 | . . . 4 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝑃 pGrp (𝐺 ↾s 𝐻)) |
| 40 | 17, 39 | syl 17 | . . 3 ⊢ (𝜑 → 𝑃 pGrp (𝐺 ↾s 𝐻)) |
| 41 | 7, 1, 22, 5, 8, 40, 19, 9 | sylow2b 19552 | . 2 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 42 | 37, 41 | reximddv 3152 | 1 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∃wrex 3060 ⊆ wss 3901 class class class wbr 5098 ↦ cmpt 5179 ran crn 5625 ‘cfv 6492 (class class class)co 7358 ≈ cen 8880 Fincfn 8883 ↑cexp 13984 ♯chash 14253 pCnt cpc 16764 Basecbs 17136 ↾s cress 17157 +gcplusg 17177 -gcsg 18865 SubGrpcsubg 19050 pGrp cpgp 19455 pSyl cslw 19456 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-inf2 9550 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-disj 5066 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-oadd 8401 df-omul 8402 df-er 8635 df-ec 8637 df-qs 8641 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-sup 9345 df-inf 9346 df-oi 9415 df-dju 9813 df-card 9851 df-acn 9854 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-n0 12402 df-xnn0 12475 df-z 12489 df-uz 12752 df-q 12862 df-rp 12906 df-fz 13424 df-fzo 13571 df-fl 13712 df-mod 13790 df-seq 13925 df-exp 13985 df-fac 14197 df-bc 14226 df-hash 14254 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-clim 15411 df-sum 15610 df-dvds 16180 df-gcd 16422 df-prm 16599 df-pc 16765 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-ress 17158 df-plusg 17190 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-submnd 18709 df-grp 18866 df-minusg 18867 df-sbg 18868 df-mulg 18998 df-subg 19053 df-eqg 19055 df-ghm 19142 df-ga 19219 df-od 19457 df-pgp 19459 df-slw 19460 |
| This theorem is referenced by: sylow3lem3 19558 sylow3lem6 19561 |
| Copyright terms: Public domain | W3C validator |