| 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 19592 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 19594). 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 482 | . . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝑋 ∈ Fin) |
| 3 | sylow2.k | . . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ (𝑃 pSyl 𝐺)) | |
| 4 | slwsubg 19579 | . . . . . . 7 ⊢ (𝐾 ∈ (𝑃 pSyl 𝐺) → 𝐾 ∈ (SubGrp‘𝐺)) | |
| 5 | 3, 4 | syl 17 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (SubGrp‘𝐺)) |
| 6 | simprl 777 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝑔 ∈ 𝑋) | |
| 7 | sylow2.x | . . . . . . 7 ⊢ 𝑋 = (Base‘𝐺) | |
| 8 | sylow2.a | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
| 9 | sylow2.d | . . . . . . 7 ⊢ − = (-g‘𝐺) | |
| 10 | eqid 2741 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) = (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) | |
| 11 | 7, 8, 9, 10 | conjsubg 19219 | . . . . . 6 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ 𝑔 ∈ 𝑋) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺)) |
| 12 | 5, 6, 11 | syl2an2r 692 | . . . . 5 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺)) |
| 13 | 7 | subgss 19098 | . . . . 5 ⊢ (ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋) |
| 14 | 12, 13 | syl 17 | . . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋) |
| 15 | 2, 14 | ssfid 9173 | . . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin) |
| 16 | simprr 779 | . . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) | |
| 17 | sylow2.h | . . . . . . 7 ⊢ (𝜑 → 𝐻 ∈ (𝑃 pSyl 𝐺)) | |
| 18 | 7, 1, 17 | slwhash 19593 | . . . . . 6 ⊢ (𝜑 → (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))) |
| 19 | 7, 1, 3 | slwhash 19593 | . . . . . 6 ⊢ (𝜑 → (♯‘𝐾) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))) |
| 20 | 18, 19 | eqtr4d 2779 | . . . . 5 ⊢ (𝜑 → (♯‘𝐻) = (♯‘𝐾)) |
| 21 | slwsubg 19579 | . . . . . . . . 9 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝐻 ∈ (SubGrp‘𝐺)) | |
| 22 | 17, 21 | syl 17 | . . . . . . . 8 ⊢ (𝜑 → 𝐻 ∈ (SubGrp‘𝐺)) |
| 23 | 7 | subgss 19098 | . . . . . . . 8 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋) |
| 24 | 22, 23 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐻 ⊆ 𝑋) |
| 25 | 1, 24 | ssfid 9173 | . . . . . 6 ⊢ (𝜑 → 𝐻 ∈ Fin) |
| 26 | 7 | subgss 19098 | . . . . . . . 8 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → 𝐾 ⊆ 𝑋) |
| 27 | 5, 26 | syl 17 | . . . . . . 7 ⊢ (𝜑 → 𝐾 ⊆ 𝑋) |
| 28 | 1, 27 | ssfid 9173 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ Fin) |
| 29 | hashen 14304 | . . . . . 6 ⊢ ((𝐻 ∈ Fin ∧ 𝐾 ∈ Fin) → ((♯‘𝐻) = (♯‘𝐾) ↔ 𝐻 ≈ 𝐾)) | |
| 30 | 25, 28, 29 | syl2anc 591 | . . . . 5 ⊢ (𝜑 → ((♯‘𝐻) = (♯‘𝐾) ↔ 𝐻 ≈ 𝐾)) |
| 31 | 20, 30 | mpbid 234 | . . . 4 ⊢ (𝜑 → 𝐻 ≈ 𝐾) |
| 32 | 7, 8, 9, 10 | conjsubgen 19220 | . . . . 5 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ 𝑔 ∈ 𝑋) → 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 33 | 5, 6, 32 | syl2an2r 692 | . . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 34 | entr 8947 | . . . 4 ⊢ ((𝐻 ≈ 𝐾 ∧ 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) → 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) | |
| 35 | 31, 33, 34 | syl2an2r 692 | . . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 36 | fisseneq 9167 | . . 3 ⊢ ((ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∧ 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) → 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) | |
| 37 | 15, 16, 35, 36 | syl3anc 1380 | . 2 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 38 | eqid 2741 | . . . . 5 ⊢ (𝐺 ↾s 𝐻) = (𝐺 ↾s 𝐻) | |
| 39 | 38 | slwpgp 19582 | . . . 4 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝑃 pGrp (𝐺 ↾s 𝐻)) |
| 40 | 17, 39 | syl 17 | . . 3 ⊢ (𝜑 → 𝑃 pGrp (𝐺 ↾s 𝐻)) |
| 41 | 7, 1, 22, 5, 8, 40, 19, 9 | sylow2b 19592 | . 2 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 42 | 37, 41 | reximddv 3157 | 1 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ∃wrex 3065 ⊆ wss 3884 class class class wbr 5074 ↦ cmpt 5155 ran crn 5621 ‘cfv 6488 (class class class)co 7359 ≈ cen 8884 Fincfn 8887 ↑cexp 14018 ♯chash 14287 pCnt cpc 16802 Basecbs 17174 ↾s cress 17195 +gcplusg 17215 -gcsg 18906 SubGrpcsubg 19091 pGrp cpgp 19495 pSyl cslw 19496 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 ax-inf2 9557 ax-cnex 11090 ax-resscn 11091 ax-1cn 11092 ax-icn 11093 ax-addcl 11094 ax-addrcl 11095 ax-mulcl 11096 ax-mulrcl 11097 ax-mulcom 11098 ax-addass 11099 ax-mulass 11100 ax-distr 11101 ax-i2m1 11102 ax-1ne0 11103 ax-1rid 11104 ax-rnegex 11105 ax-rrecex 11106 ax-cnre 11107 ax-pre-lttri 11108 ax-pre-lttrn 11109 ax-pre-ltadd 11110 ax-pre-mulgt0 11111 ax-pre-sup 11112 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-int 4880 df-iun 4925 df-disj 5042 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-se 5574 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-isom 6497 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-om 7810 df-1st 7933 df-2nd 7934 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8343 df-1o 8399 df-2o 8400 df-oadd 8403 df-omul 8404 df-er 8637 df-ec 8639 df-qs 8643 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-sup 9349 df-inf 9350 df-oi 9419 df-dju 9820 df-card 9858 df-acn 9861 df-pnf 11177 df-mnf 11178 df-xr 11179 df-ltxr 11180 df-le 11181 df-sub 11375 df-neg 11376 df-div 11804 df-nn 12170 df-2 12239 df-3 12240 df-n0 12433 df-xnn0 12506 df-z 12520 df-uz 12784 df-q 12894 df-rp 12938 df-fz 13457 df-fzo 13604 df-fl 13746 df-mod 13824 df-seq 13959 df-exp 14019 df-fac 14231 df-bc 14260 df-hash 14288 df-cj 15056 df-re 15057 df-im 15058 df-sqrt 15192 df-abs 15193 df-clim 15445 df-sum 15644 df-dvds 16217 df-gcd 16459 df-prm 16636 df-pc 16803 df-sets 17129 df-slot 17147 df-ndx 17159 df-base 17175 df-ress 17196 df-plusg 17228 df-0g 17399 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-submnd 18747 df-grp 18907 df-minusg 18908 df-sbg 18909 df-mulg 19039 df-subg 19094 df-eqg 19096 df-ghm 19183 df-ga 19259 df-od 19497 df-pgp 19499 df-slw 19500 |
| This theorem is referenced by: sylow3lem3 19598 sylow3lem6 19601 |
| Copyright terms: Public domain | W3C validator |