| 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 19817 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 19819). 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 486 | . . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝑋 ∈ Fin) |
| 3 | sylow2.k | . . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ (𝑃 pSyl 𝐺)) | |
| 4 | slwsubg 19804 | . . . . . . 7 ⊢ (𝐾 ∈ (𝑃 pSyl 𝐺) → 𝐾 ∈ (SubGrp‘𝐺)) | |
| 5 | 3, 4 | syl 18 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ (SubGrp‘𝐺)) |
| 6 | simprl 783 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝑔 ∈ 𝑋) | |
| 7 | sylow2.x | . . . . . . 7 ⊢ 𝑋 = (Base‘𝐺) | |
| 8 | sylow2.a | . . . . . . 7 ⊢ + = (+g‘𝐺) | |
| 9 | sylow2.d | . . . . . . 7 ⊢ − = (-g‘𝐺) | |
| 10 | eqid 2761 | . . . . . . 7 ⊢ (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) = (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) | |
| 11 | 7, 8, 9, 10 | conjsubg 19444 | . . . . . 6 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ 𝑔 ∈ 𝑋) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺)) |
| 12 | 5, 6, 11 | syl2an2r 698 | . . . . 5 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺)) |
| 13 | 7 | subgss 19317 | . . . . 5 ⊢ (ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋) |
| 14 | 12, 13 | syl 18 | . . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋) |
| 15 | 2, 14 | ssfid 9244 | . . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin) |
| 16 | simprr 785 | . . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) | |
| 17 | sylow2.h | . . . . . . 7 ⊢ (𝜑 → 𝐻 ∈ (𝑃 pSyl 𝐺)) | |
| 18 | 7, 1, 17 | slwhash 19818 | . . . . . 6 ⊢ (𝜑 → (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))) |
| 19 | 7, 1, 3 | slwhash 19818 | . . . . . 6 ⊢ (𝜑 → (♯‘𝐾) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))) |
| 20 | 18, 19 | eqtr4d 2799 | . . . . 5 ⊢ (𝜑 → (♯‘𝐻) = (♯‘𝐾)) |
| 21 | slwsubg 19804 | . . . . . . . . 9 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝐻 ∈ (SubGrp‘𝐺)) | |
| 22 | 17, 21 | syl 18 | . . . . . . . 8 ⊢ (𝜑 → 𝐻 ∈ (SubGrp‘𝐺)) |
| 23 | 7 | subgss 19317 | . . . . . . . 8 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋) |
| 24 | 22, 23 | syl 18 | . . . . . . 7 ⊢ (𝜑 → 𝐻 ⊆ 𝑋) |
| 25 | 1, 24 | ssfid 9244 | . . . . . 6 ⊢ (𝜑 → 𝐻 ∈ Fin) |
| 26 | 7 | subgss 19317 | . . . . . . . 8 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → 𝐾 ⊆ 𝑋) |
| 27 | 5, 26 | syl 18 | . . . . . . 7 ⊢ (𝜑 → 𝐾 ⊆ 𝑋) |
| 28 | 1, 27 | ssfid 9244 | . . . . . 6 ⊢ (𝜑 → 𝐾 ∈ Fin) |
| 29 | hashen 14471 | . . . . . 6 ⊢ ((𝐻 ∈ Fin ∧ 𝐾 ∈ Fin) → ((♯‘𝐻) = (♯‘𝐾) ↔ 𝐻 ≈ 𝐾)) | |
| 30 | 25, 28, 29 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → ((♯‘𝐻) = (♯‘𝐾) ↔ 𝐻 ≈ 𝐾)) |
| 31 | 20, 30 | mpbid 235 | . . . 4 ⊢ (𝜑 → 𝐻 ≈ 𝐾) |
| 32 | 7, 8, 9, 10 | conjsubgen 19445 | . . . . 5 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ 𝑔 ∈ 𝑋) → 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 33 | 5, 6, 32 | syl2an2r 698 | . . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 34 | entr 9017 | . . . 4 ⊢ ((𝐻 ≈ 𝐾 ∧ 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) → 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) | |
| 35 | 31, 33, 34 | syl2an2r 698 | . . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 36 | fisseneq 9238 | . . 3 ⊢ ((ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∧ 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) → 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) | |
| 37 | 15, 16, 35, 36 | syl3anc 1398 | . 2 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 38 | eqid 2761 | . . . . 5 ⊢ (𝐺 ↾s 𝐻) = (𝐺 ↾s 𝐻) | |
| 39 | 38 | slwpgp 19807 | . . . 4 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝑃 pGrp (𝐺 ↾s 𝐻)) |
| 40 | 17, 39 | syl 18 | . . 3 ⊢ (𝜑 → 𝑃 pGrp (𝐺 ↾s 𝐻)) |
| 41 | 7, 1, 22, 5, 8, 40, 19, 9 | sylow2b 19817 | . 2 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| 42 | 37, 41 | reximddv 3179 | 1 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∃wrex 3087 ⊆ wss 3899 class class class wbr 5103 ↦ cmpt 5186 ran crn 5652 ‘cfv 6531 (class class class)co 7412 ≈ cen 8954 Fincfn 8957 ↑cexp 14184 ♯chash 14454 pCnt cpc 16994 Basecbs 17367 ↾s cress 17388 +gcplusg 17408 -gcsg 19126 SubGrpcsubg 19310 pGrp cpgp 19720 pSyl cslw 19721 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-inf2 9626 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-pre-sup 11259 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-disj 5071 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-2o 8461 df-oadd 8464 df-omul 8465 df-er 8701 df-ec 8703 df-qs 8707 df-map 8833 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-sup 9418 df-inf 9419 df-oi 9488 df-dju 9963 df-card 10001 df-acn 10004 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-2 12386 df-3 12387 df-n0 12588 df-xnn0 12661 df-z 12675 df-uz 12947 df-q 13057 df-rp 13102 df-fz 13621 df-fzo 13769 df-fl 13912 df-mod 13990 df-seq 14125 df-exp 14185 df-fac 14398 df-bc 14427 df-hash 14455 df-cj 15246 df-re 15247 df-im 15248 df-sqrt 15382 df-abs 15383 df-clim 15635 df-sum 15834 df-dvds 16403 df-gcd 16645 df-prm 16827 df-pc 16995 df-sets 17322 df-slot 17340 df-ndx 17352 df-base 17368 df-ress 17389 df-plusg 17421 df-0g 17592 df-mgm 18796 df-sgrp 18888 df-mnd 18904 df-submnd 18959 df-grp 19127 df-minusg 19128 df-sbg 19129 df-mulg 19258 df-subg 19313 df-eqg 19315 df-ghm 19408 df-ga 19484 df-od 19722 df-pgp 19724 df-slw 19725 |
| This theorem is used by: sylow3lem3 19823 sylow3lem6 19826 |
| Copyright terms: Public domain | W3C validator |