sylow2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > sylow2		Structured version Visualization version GIF version

Theorem sylow2 18041

Description: Sylow's second theorem. See also sylow2b 18038 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 18040). This is part of Metamath 100 proof #72. (Contributed by Mario Carneiro, 18-Jan-2015.)

**Hypotheses**
Ref	Expression
sylow2.x	⊢ 𝑋 = (Base‘𝐺)
sylow2.f	⊢ (𝜑 → 𝑋 ∈ Fin)
sylow2.h	⊢ (𝜑 → 𝐻 ∈ (𝑃 pSyl 𝐺))
sylow2.k	⊢ (𝜑 → 𝐾 ∈ (𝑃 pSyl 𝐺))
sylow2.a	⊢ + = (+_g‘𝐺)
sylow2.d	⊢ − = (-_g‘𝐺)

**Assertion**
Ref	Expression
sylow2	⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))

Distinct variable groups: 𝑥, − 𝑥,𝑔, + 𝑔,𝐺,𝑥 𝑔,𝐻,𝑥 𝑔,𝐾,𝑥 𝜑,𝑔 𝑔,𝑋,𝑥 Allowed substitution hints: 𝜑(𝑥) 𝑃(𝑥,𝑔) − (𝑔)

**Proof of Theorem sylow2**
Step	Hyp	Ref	Expression
1		sylow2.f	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ Fin)
2	1	adantr 481	. . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝑋 ∈ Fin)
3		sylow2.k	. . . . . . . 8 ⊢ (𝜑 → 𝐾 ∈ (𝑃 pSyl 𝐺))
4		slwsubg 18025	. . . . . . . 8 ⊢ (𝐾 ∈ (𝑃 pSyl 𝐺) → 𝐾 ∈ (SubGrp‘𝐺))
5	3, 4	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ (SubGrp‘𝐺))
6	5	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐾 ∈ (SubGrp‘𝐺))
7		simprl 794	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝑔 ∈ 𝑋)
8		sylow2.x	. . . . . . 7 ⊢ 𝑋 = (Base‘𝐺)
9		sylow2.a	. . . . . . 7 ⊢ + = (+_g‘𝐺)
10		sylow2.d	. . . . . . 7 ⊢ − = (-_g‘𝐺)
11		eqid 2622	. . . . . . 7 ⊢ (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) = (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))
12	8, 9, 10, 11	conjsubg 17692	. . . . . 6 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ 𝑔 ∈ 𝑋) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺))
13	6, 7, 12	syl2anc 693	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺))
14	8	subgss 17595	. . . . 5 ⊢ (ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋)
15	13, 14	syl 17	. . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋)
16		ssfi 8180	. . . 4 ⊢ ((𝑋 ∈ Fin ∧ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin)
17	2, 15, 16	syl2anc 693	. . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin)
18		simprr 796	. . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
19		sylow2.h	. . . . . . . 8 ⊢ (𝜑 → 𝐻 ∈ (𝑃 pSyl 𝐺))
20	8, 1, 19	slwhash 18039	. . . . . . 7 ⊢ (𝜑 → (#‘𝐻) = (𝑃↑(𝑃 pCnt (#‘𝑋))))
21	8, 1, 3	slwhash 18039	. . . . . . 7 ⊢ (𝜑 → (#‘𝐾) = (𝑃↑(𝑃 pCnt (#‘𝑋))))
22	20, 21	eqtr4d 2659	. . . . . 6 ⊢ (𝜑 → (#‘𝐻) = (#‘𝐾))
23		slwsubg 18025	. . . . . . . . . 10 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝐻 ∈ (SubGrp‘𝐺))
24	19, 23	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐻 ∈ (SubGrp‘𝐺))
25	8	subgss 17595	. . . . . . . . 9 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋)
26	24, 25	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐻 ⊆ 𝑋)
27		ssfi 8180	. . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝐻 ⊆ 𝑋) → 𝐻 ∈ Fin)
28	1, 26, 27	syl2anc 693	. . . . . . 7 ⊢ (𝜑 → 𝐻 ∈ Fin)
29	8	subgss 17595	. . . . . . . . 9 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → 𝐾 ⊆ 𝑋)
30	5, 29	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐾 ⊆ 𝑋)
31		ssfi 8180	. . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝐾 ⊆ 𝑋) → 𝐾 ∈ Fin)
32	1, 30, 31	syl2anc 693	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Fin)
33		hashen 13135	. . . . . . 7 ⊢ ((𝐻 ∈ Fin ∧ 𝐾 ∈ Fin) → ((#‘𝐻) = (#‘𝐾) ↔ 𝐻 ≈ 𝐾))
34	28, 32, 33	syl2anc 693	. . . . . 6 ⊢ (𝜑 → ((#‘𝐻) = (#‘𝐾) ↔ 𝐻 ≈ 𝐾))
35	22, 34	mpbid 222	. . . . 5 ⊢ (𝜑 → 𝐻 ≈ 𝐾)
36	35	adantr 481	. . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ≈ 𝐾)
37	8, 9, 10, 11	conjsubgen 17693	. . . . 5 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ 𝑔 ∈ 𝑋) → 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
38	6, 7, 37	syl2anc 693	. . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
39		entr 8008	. . . 4 ⊢ ((𝐻 ≈ 𝐾 ∧ 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) → 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
40	36, 38, 39	syl2anc 693	. . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
41		fisseneq 8171	. . 3 ⊢ ((ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∧ 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) → 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
42	17, 18, 40, 41	syl3anc 1326	. 2 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
43		eqid 2622	. . . . 5 ⊢ (𝐺 ↾_s 𝐻) = (𝐺 ↾_s 𝐻)
44	43	slwpgp 18028	. . . 4 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝑃 pGrp (𝐺 ↾_s 𝐻))
45	19, 44	syl 17	. . 3 ⊢ (𝜑 → 𝑃 pGrp (𝐺 ↾_s 𝐻))
46	8, 1, 24, 5, 9, 45, 21, 10	sylow2b 18038	. 2 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
47	42, 46	reximddv 3018	1 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∃wrex 2913 ⊆ wss 3574 class class class wbr 4653 ↦ cmpt 4729 ran crn 5115 ‘cfv 5888 (class class class)co 6650 ≈ cen 7952 Fincfn 7955 ↑cexp 12860 #chash 13117 pCnt cpc 15541 Basecbs 15857 ↾_s cress 15858 +_gcplusg 15941 -_gcsg 17424 SubGrpcsubg 17588 pGrp cpgp 17946 pSyl cslw 17947

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-inf2 8538 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013 ax-pre-sup 10014

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-fal 1489 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-disj 4621 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-se 5074 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-isom 5897 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-2o 7561 df-oadd 7564 df-omul 7565 df-er 7742 df-ec 7744 df-qs 7748 df-map 7859 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-sup 8348 df-inf 8349 df-oi 8415 df-card 8765 df-acn 8768 df-cda 8990 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-div 10685 df-nn 11021 df-2 11079 df-3 11080 df-n0 11293 df-xnn0 11364 df-z 11378 df-uz 11688 df-q 11789 df-rp 11833 df-fz 12327 df-fzo 12466 df-fl 12593 df-mod 12669 df-seq 12802 df-exp 12861 df-fac 13061 df-bc 13090 df-hash 13118 df-cj 13839 df-re 13840 df-im 13841 df-sqrt 13975 df-abs 13976 df-clim 14219 df-sum 14417 df-dvds 14984 df-gcd 15217 df-prm 15386 df-pc 15542 df-ndx 15860 df-slot 15861 df-base 15863 df-sets 15864 df-ress 15865 df-plusg 15954 df-0g 16102 df-mgm 17242 df-sgrp 17284 df-mnd 17295 df-submnd 17336 df-grp 17425 df-minusg 17426 df-sbg 17427 df-mulg 17541 df-subg 17591 df-eqg 17593 df-ghm 17658 df-ga 17723 df-od 17948 df-pgp 17950 df-slw 17951

This theorem is referenced by: sylow3lem3 18044 sylow3lem6 18047

W3C validator