Theorem isslw 19520

Description: The property of being a Sylow subgroup. A Sylow 𝑃-subgroup is a 𝑃-group which has no proper supersets that are also 𝑃-groups. (Contributed by Mario Carneiro, 16-Jan-2015.)

Assertion

Ref	Expression
isslw	⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) ↔ (𝑃 ∈ ℙ ∧ 𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘)))

Distinct variable groups:   𝑘,𝐺   𝑘,𝐻   𝑃,𝑘

Proof of Theorem isslw

Dummy variables 𝑔 ℎ 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-slw 19443	. . 3 ⊢ pSyl = (𝑝 ∈ ℙ, 𝑔 ∈ Grp ↦ {ℎ ∈ (SubGrp‘𝑔) ∣ ∀𝑘 ∈ (SubGrp‘𝑔)((ℎ ⊆ 𝑘 ∧ 𝑝 pGrp (𝑔 ↾s 𝑘)) ↔ ℎ = 𝑘)})
2	1	elmpocl 7587	. 2 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → (𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp))
3		simp1 1136	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘)) → 𝑃 ∈ ℙ)
4		subgrcl 19044	. . . 4 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
5	4	3ad2ant2 1134	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘)) → 𝐺 ∈ Grp)
6	3, 5	jca 511	. 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘)) → (𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp))
7		simpr 484	. . . . . . . . 9 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → 𝑔 = 𝐺)
8	7	fveq2d 6826	. . . . . . . 8 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → (SubGrp‘𝑔) = (SubGrp‘𝐺))
9		simpl 482	. . . . . . . . . . . 12 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → 𝑝 = 𝑃)
10	7	oveq1d 7361	. . . . . . . . . . . 12 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → (𝑔 ↾s 𝑘) = (𝐺 ↾s 𝑘))
11	9, 10	breq12d 5102	. . . . . . . . . . 11 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → (𝑝 pGrp (𝑔 ↾s 𝑘) ↔ 𝑃 pGrp (𝐺 ↾s 𝑘)))
12	11	anbi2d 630	. . . . . . . . . 10 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → ((ℎ ⊆ 𝑘 ∧ 𝑝 pGrp (𝑔 ↾s 𝑘)) ↔ (ℎ ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘))))
13	12	bibi1d 343	. . . . . . . . 9 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → (((ℎ ⊆ 𝑘 ∧ 𝑝 pGrp (𝑔 ↾s 𝑘)) ↔ ℎ = 𝑘) ↔ ((ℎ ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ ℎ = 𝑘)))
14	8, 13	raleqbidv 3312	. . . . . . . 8 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → (∀𝑘 ∈ (SubGrp‘𝑔)((ℎ ⊆ 𝑘 ∧ 𝑝 pGrp (𝑔 ↾s 𝑘)) ↔ ℎ = 𝑘) ↔ ∀𝑘 ∈ (SubGrp‘𝐺)((ℎ ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ ℎ = 𝑘)))
15	8, 14	rabeqbidv 3413	. . . . . . 7 ⊢ ((𝑝 = 𝑃 ∧ 𝑔 = 𝐺) → {ℎ ∈ (SubGrp‘𝑔) ∣ ∀𝑘 ∈ (SubGrp‘𝑔)((ℎ ⊆ 𝑘 ∧ 𝑝 pGrp (𝑔 ↾s 𝑘)) ↔ ℎ = 𝑘)} = {ℎ ∈ (SubGrp‘𝐺) ∣ ∀𝑘 ∈ (SubGrp‘𝐺)((ℎ ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ ℎ = 𝑘)})
16		fvex 6835	. . . . . . . 8 ⊢ (SubGrp‘𝐺) ∈ V
17	16	rabex 5275	. . . . . . 7 ⊢ {ℎ ∈ (SubGrp‘𝐺) ∣ ∀𝑘 ∈ (SubGrp‘𝐺)((ℎ ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ ℎ = 𝑘)} ∈ V
18	15, 1, 17	ovmpoa 7501	. . . . . 6 ⊢ ((𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp) → (𝑃 pSyl 𝐺) = {ℎ ∈ (SubGrp‘𝐺) ∣ ∀𝑘 ∈ (SubGrp‘𝐺)((ℎ ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ ℎ = 𝑘)})
19	18	eleq2d 2817	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp) → (𝐻 ∈ (𝑃 pSyl 𝐺) ↔ 𝐻 ∈ {ℎ ∈ (SubGrp‘𝐺) ∣ ∀𝑘 ∈ (SubGrp‘𝐺)((ℎ ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ ℎ = 𝑘)}))
20		cleq1lem 14889	. . . . . . . 8 ⊢ (ℎ = 𝐻 → ((ℎ ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘))))
21		eqeq1 2735	. . . . . . . 8 ⊢ (ℎ = 𝐻 → (ℎ = 𝑘 ↔ 𝐻 = 𝑘))
22	20, 21	bibi12d 345	. . . . . . 7 ⊢ (ℎ = 𝐻 → (((ℎ ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ ℎ = 𝑘) ↔ ((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘)))
23	22	ralbidv 3155	. . . . . 6 ⊢ (ℎ = 𝐻 → (∀𝑘 ∈ (SubGrp‘𝐺)((ℎ ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ ℎ = 𝑘) ↔ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘)))
24	23	elrab 3642	. . . . 5 ⊢ (𝐻 ∈ {ℎ ∈ (SubGrp‘𝐺) ∣ ∀𝑘 ∈ (SubGrp‘𝐺)((ℎ ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ ℎ = 𝑘)} ↔ (𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘)))
25	19, 24	bitrdi 287	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp) → (𝐻 ∈ (𝑃 pSyl 𝐺) ↔ (𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘))))
26		simpl 482	. . . . 5 ⊢ ((𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp) → 𝑃 ∈ ℙ)
27	26	biantrurd 532	. . . 4 ⊢ ((𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp) → ((𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘)) ↔ (𝑃 ∈ ℙ ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘)))))
28	25, 27	bitrd 279	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp) → (𝐻 ∈ (𝑃 pSyl 𝐺) ↔ (𝑃 ∈ ℙ ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘)))))
29		3anass 1094	. . 3 ⊢ ((𝑃 ∈ ℙ ∧ 𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘)) ↔ (𝑃 ∈ ℙ ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘))))
30	28, 29	bitr4di 289	. 2 ⊢ ((𝑃 ∈ ℙ ∧ 𝐺 ∈ Grp) → (𝐻 ∈ (𝑃 pSyl 𝐺) ↔ (𝑃 ∈ ℙ ∧ 𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘))))
31	2, 6, 30	pm5.21nii 378	1 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) ↔ (𝑃 ∈ ℙ ∧ 𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾s 𝑘)) ↔ 𝐻 = 𝑘)))

Syntax hints:   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2111  ∀wral 3047  {crab 3395   ⊆ wss 3897   class class class wbr 5089  ‘cfv 6481  (class class class)co 7346  ℙcprime 16582   ↾_s cress 17141  Grpcgrp 18846  SubGrpcsubg 19033   pGrp cpgp 19438   pSyl cslw 19439

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 2113  ax-9 2121  ax-10 2144  ax-11 2160  ax-12 2180  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pow 5301  ax-pr 5368

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2535  df-eu 2564  df-clab 2710  df-cleq 2723  df-clel 2806  df-nfc 2881  df-ne 2929  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-sbc 3737  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4281  df-if 4473  df-pw 4549  df-sn 4574  df-pr 4576  df-op 4580  df-uni 4857  df-br 5090  df-opab 5152  df-mpt 5171  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-ima 5627  df-iota 6437  df-fun 6483  df-fv 6489  df-ov 7349  df-oprab 7350  df-mpo 7351  df-subg 19036  df-slw 19443

This theorem is referenced by:  slwprm  19521  slwsubg  19522  slwispgp  19523  pgpssslw  19526  subgslw  19528  fislw  19537