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 17864

Description: Sylow's second theorem. See also sylow2b 17861 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 17863). 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 480	. . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝑋 ∈ Fin)
3		sylow2.k	. . . . . . . 8 ⊢ (𝜑 → 𝐾 ∈ (𝑃 pSyl 𝐺))
4		slwsubg 17848	. . . . . . . 8 ⊢ (𝐾 ∈ (𝑃 pSyl 𝐺) → 𝐾 ∈ (SubGrp‘𝐺))
5	3, 4	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ (SubGrp‘𝐺))
6	5	adantr 480	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐾 ∈ (SubGrp‘𝐺))
7		simprl 790	. . . . . 6 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝑔 ∈ 𝑋)
8		sylow2.x	. . . . . . 7 ⊢ 𝑋 = (Base‘𝐺)
9		sylow2.a	. . . . . . 7 ⊢ + = (+_g‘𝐺)
10		sylow2.d	. . . . . . 7 ⊢ − = (-_g‘𝐺)
11		eqid 2610	. . . . . . 7 ⊢ (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) = (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))
12	8, 9, 10, 11	conjsubg 17515	. . . . . 6 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ 𝑔 ∈ 𝑋) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺))
13	6, 7, 12	syl2anc 691	. . . . 5 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺))
14	8	subgss 17418	. . . . 5 ⊢ (ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ (SubGrp‘𝐺) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋)
15	13, 14	syl 17	. . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋)
16		ssfi 8065	. . . 4 ⊢ ((𝑋 ∈ Fin ∧ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ⊆ 𝑋) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin)
17	2, 15, 16	syl2anc 691	. . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin)
18		simprr 792	. . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
19		sylow2.h	. . . . . . . 8 ⊢ (𝜑 → 𝐻 ∈ (𝑃 pSyl 𝐺))
20	8, 1, 19	slwhash 17862	. . . . . . 7 ⊢ (𝜑 → (#‘𝐻) = (𝑃↑(𝑃 pCnt (#‘𝑋))))
21	8, 1, 3	slwhash 17862	. . . . . . 7 ⊢ (𝜑 → (#‘𝐾) = (𝑃↑(𝑃 pCnt (#‘𝑋))))
22	20, 21	eqtr4d 2647	. . . . . 6 ⊢ (𝜑 → (#‘𝐻) = (#‘𝐾))
23		slwsubg 17848	. . . . . . . . . 10 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝐻 ∈ (SubGrp‘𝐺))
24	19, 23	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐻 ∈ (SubGrp‘𝐺))
25	8	subgss 17418	. . . . . . . . 9 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋)
26	24, 25	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐻 ⊆ 𝑋)
27		ssfi 8065	. . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝐻 ⊆ 𝑋) → 𝐻 ∈ Fin)
28	1, 26, 27	syl2anc 691	. . . . . . 7 ⊢ (𝜑 → 𝐻 ∈ Fin)
29	8	subgss 17418	. . . . . . . . 9 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → 𝐾 ⊆ 𝑋)
30	5, 29	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝐾 ⊆ 𝑋)
31		ssfi 8065	. . . . . . . 8 ⊢ ((𝑋 ∈ Fin ∧ 𝐾 ⊆ 𝑋) → 𝐾 ∈ Fin)
32	1, 30, 31	syl2anc 691	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ Fin)
33		hashen 12997	. . . . . . 7 ⊢ ((𝐻 ∈ Fin ∧ 𝐾 ∈ Fin) → ((#‘𝐻) = (#‘𝐾) ↔ 𝐻 ≈ 𝐾))
34	28, 32, 33	syl2anc 691	. . . . . 6 ⊢ (𝜑 → ((#‘𝐻) = (#‘𝐾) ↔ 𝐻 ≈ 𝐾))
35	22, 34	mpbid 221	. . . . 5 ⊢ (𝜑 → 𝐻 ≈ 𝐾)
36	35	adantr 480	. . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ≈ 𝐾)
37	8, 9, 10, 11	conjsubgen 17516	. . . . 5 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ 𝑔 ∈ 𝑋) → 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
38	6, 7, 37	syl2anc 691	. . . 4 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
39		entr 7894	. . . 4 ⊢ ((𝐻 ≈ 𝐾 ∧ 𝐾 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) → 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
40	36, 38, 39	syl2anc 691	. . 3 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
41		fisseneq 8056	. . 3 ⊢ ((ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∈ Fin ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ∧ 𝐻 ≈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))) → 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
42	17, 18, 40, 41	syl3anc 1318	. 2 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))) → 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
43		eqid 2610	. . . . 5 ⊢ (𝐺 ↾_s 𝐻) = (𝐺 ↾_s 𝐻)
44	43	slwpgp 17851	. . . 4 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝑃 pGrp (𝐺 ↾_s 𝐻))
45	19, 44	syl 17	. . 3 ⊢ (𝜑 → 𝑃 pGrp (𝐺 ↾_s 𝐻))
46	8, 1, 24, 5, 9, 45, 21, 10	sylow2b 17861	. 2 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
47	42, 46	reximddv 3001	1 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 = ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∃wrex 2897 ⊆ wss 3540 class class class wbr 4583 ↦ cmpt 4643 ran crn 5039 ‘cfv 5804 (class class class)co 6549 ≈ cen 7838 Fincfn 7841 ↑cexp 12722 #chash 12979 pCnt cpc 15379 Basecbs 15695 ↾_s cress 15696 +_gcplusg 15768 -_gcsg 17247 SubGrpcsubg 17411 pGrp cpgp 17769 pSyl cslw 17770

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-inf2 8421 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893

This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-disj 4554 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-se 4998 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-isom 5813 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-2o 7448 df-oadd 7451 df-omul 7452 df-er 7629 df-ec 7631 df-qs 7635 df-map 7746 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-sup 8231 df-inf 8232 df-oi 8298 df-card 8648 df-acn 8651 df-cda 8873 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-n0 11170 df-xnn0 11241 df-z 11255 df-uz 11564 df-q 11665 df-rp 11709 df-fz 12198 df-fzo 12335 df-fl 12455 df-mod 12531 df-seq 12664 df-exp 12723 df-fac 12923 df-bc 12952 df-hash 12980 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-clim 14067 df-sum 14265 df-dvds 14822 df-gcd 15055 df-prm 15224 df-pc 15380 df-ndx 15698 df-slot 15699 df-base 15700 df-sets 15701 df-ress 15702 df-plusg 15781 df-0g 15925 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-submnd 17159 df-grp 17248 df-minusg 17249 df-sbg 17250 df-mulg 17364 df-subg 17414 df-eqg 17416 df-ghm 17481 df-ga 17546 df-od 17771 df-pgp 17773 df-slw 17774

This theorem is referenced by: sylow3lem3 17867 sylow3lem6 17870

W3C validator