fislw - Metamath Proof Explorer

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

Theorem fislw 19656

Description: The sylow subgroups of a finite group are exactly the groups which have cardinality equal to the maximum power of 𝑃 dividing the group. (Contributed by Mario Carneiro, 16-Jan-2015.)

**Hypothesis**
Ref	Expression
fislw.1	⊢ 𝑋 = (Base‘𝐺)

**Assertion**
Ref	Expression
fislw	⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) → (𝐻 ∈ (𝑃 pSyl 𝐺) ↔ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))))

Proof of Theorem fislw Dummy variables 𝑘 𝑛 𝑝 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 488	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → 𝐻 ∈ (𝑃 pSyl 𝐺))
2		slwsubg 19641	. . . 4 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝐻 ∈ (SubGrp‘𝐺))
3	1, 2	syl 17	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → 𝐻 ∈ (SubGrp‘𝐺))
4		fislw.1	. . . 4 ⊢ 𝑋 = (Base‘𝐺)
5		simpl2 1205	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → 𝑋 ∈ Fin)
6	4, 5, 1	slwhash 19655	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
7	3, 6	jca 519	. 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))))
8		simpl3 1206	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝑃 ∈ ℙ)
9		simprl 780	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 ∈ (SubGrp‘𝐺))
10		simpl2 1205	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝑋 ∈ Fin)
11	10	adantr 484	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑋 ∈ Fin)
12		simprl 780	. . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ∈ (SubGrp‘𝐺))
13	4	subgss 19160	. . . . . . . . 9 ⊢ (𝑘 ∈ (SubGrp‘𝐺) → 𝑘 ⊆ 𝑋)
14	12, 13	syl 17	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ⊆ 𝑋)
15	11, 14	ssfid 9207	. . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ∈ Fin)
16		simprrl 790	. . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 ⊆ 𝑘)
17		ssdomg 8975	. . . . . . . . 9 ⊢ (𝑘 ∈ Fin → (𝐻 ⊆ 𝑘 → 𝐻 ≼ 𝑘))
18	15, 16, 17	sylc 65	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 ≼ 𝑘)
19		simprrr 791	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑃 pGrp (𝐺 ↾_s 𝑘))
20		eqid 2761	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐺 ↾_s 𝑘) = (𝐺 ↾_s 𝑘)
21	20	subggrp 19162	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (SubGrp‘𝐺) → (𝐺 ↾_s 𝑘) ∈ Grp)
22	12, 21	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝐺 ↾_s 𝑘) ∈ Grp)
23	20	subgbas 19163	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (SubGrp‘𝐺) → 𝑘 = (Base‘(𝐺 ↾_s 𝑘)))
24	12, 23	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 = (Base‘(𝐺 ↾_s 𝑘)))
25	24, 15	eqeltrrd 2862	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (Base‘(𝐺 ↾_s 𝑘)) ∈ Fin)
26		eqid 2761	. . . . . . . . . . . . . . . . 17 ⊢ (Base‘(𝐺 ↾_s 𝑘)) = (Base‘(𝐺 ↾_s 𝑘))
27	26	pgpfi 19636	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ↾_s 𝑘) ∈ Grp ∧ (Base‘(𝐺 ↾_s 𝑘)) ∈ Fin) → (𝑃 pGrp (𝐺 ↾_s 𝑘) ↔ (𝑃 ∈ ℙ ∧ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛))))
28	22, 25, 27	syl2anc 593	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pGrp (𝐺 ↾_s 𝑘) ↔ (𝑃 ∈ ℙ ∧ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛))))
29	19, 28	mpbid 234	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 ∈ ℙ ∧ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛)))
30	29	simpld 498	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑃 ∈ ℙ)
31		prmnn 16699	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
32	30, 31	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑃 ∈ ℕ)
33	32	nnred 12219	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑃 ∈ ℝ)
34	32	nnge1d 12255	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 1 ≤ 𝑃)
35		eqid 2761	. . . . . . . . . . . . . . . . . 18 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
36	35	subg0cl 19167	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (SubGrp‘𝐺) → (0_g‘𝐺) ∈ 𝑘)
37	12, 36	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (0_g‘𝐺) ∈ 𝑘)
38	37	ne0d 4292	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ≠ ∅)
39		hashnncl 14373	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ Fin → ((♯‘𝑘) ∈ ℕ ↔ 𝑘 ≠ ∅))
40	15, 39	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ((♯‘𝑘) ∈ ℕ ↔ 𝑘 ≠ ∅))
41	38, 40	mpbird 259	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑘) ∈ ℕ)
42	30, 41	pccld 16877	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑘)) ∈ ℕ₀)
43	42	nn0zd 12587	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑘)) ∈ ℤ)
44		simpl1 1204	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐺 ∈ Grp)
45	4	grpbn0 18999	. . . . . . . . . . . . . . . . 17 ⊢ (𝐺 ∈ Grp → 𝑋 ≠ ∅)
46	44, 45	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝑋 ≠ ∅)
47		hashnncl 14373	. . . . . . . . . . . . . . . . 17 ⊢ (𝑋 ∈ Fin → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅))
48	10, 47	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅))
49	46, 48	mpbird 259	. . . . . . . . . . . . . . 15 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (♯‘𝑋) ∈ ℕ)
50	8, 49	pccld 16877	. . . . . . . . . . . . . 14 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (𝑃 pCnt (♯‘𝑋)) ∈ ℕ₀)
51	50	adantr 484	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑋)) ∈ ℕ₀)
52	51	nn0zd 12587	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑋)) ∈ ℤ)
53		oveq1 7398	. . . . . . . . . . . . . 14 ⊢ (𝑝 = 𝑃 → (𝑝 pCnt (♯‘𝑘)) = (𝑃 pCnt (♯‘𝑘)))
54		oveq1 7398	. . . . . . . . . . . . . 14 ⊢ (𝑝 = 𝑃 → (𝑝 pCnt (♯‘𝑋)) = (𝑃 pCnt (♯‘𝑋)))
55	53, 54	breq12d 5110	. . . . . . . . . . . . 13 ⊢ (𝑝 = 𝑃 → ((𝑝 pCnt (♯‘𝑘)) ≤ (𝑝 pCnt (♯‘𝑋)) ↔ (𝑃 pCnt (♯‘𝑘)) ≤ (𝑃 pCnt (♯‘𝑋))))
56	4	lagsubg 19227	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑘) ∥ (♯‘𝑋))
57	12, 11, 56	syl2anc 593	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑘) ∥ (♯‘𝑋))
58	41	nnzd 12588	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑘) ∈ ℤ)
59	49	adantr 484	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑋) ∈ ℕ)
60	59	nnzd 12588	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑋) ∈ ℤ)
61		pc2dvds 16906	. . . . . . . . . . . . . . 15 ⊢ (((♯‘𝑘) ∈ ℤ ∧ (♯‘𝑋) ∈ ℤ) → ((♯‘𝑘) ∥ (♯‘𝑋) ↔ ∀𝑝 ∈ ℙ (𝑝 pCnt (♯‘𝑘)) ≤ (𝑝 pCnt (♯‘𝑋))))
62	58, 60, 61	syl2anc 593	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ((♯‘𝑘) ∥ (♯‘𝑋) ↔ ∀𝑝 ∈ ℙ (𝑝 pCnt (♯‘𝑘)) ≤ (𝑝 pCnt (♯‘𝑋))))
63	57, 62	mpbid 234	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ∀𝑝 ∈ ℙ (𝑝 pCnt (♯‘𝑘)) ≤ (𝑝 pCnt (♯‘𝑋)))
64	55, 63, 30	rspcdva 3581	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑘)) ≤ (𝑃 pCnt (♯‘𝑋)))
65		eluz2 12839	. . . . . . . . . . . 12 ⊢ ((𝑃 pCnt (♯‘𝑋)) ∈ (ℤ_≥‘(𝑃 pCnt (♯‘𝑘))) ↔ ((𝑃 pCnt (♯‘𝑘)) ∈ ℤ ∧ (𝑃 pCnt (♯‘𝑋)) ∈ ℤ ∧ (𝑃 pCnt (♯‘𝑘)) ≤ (𝑃 pCnt (♯‘𝑋))))
66	43, 52, 64, 65	syl3anbrc 1356	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑋)) ∈ (ℤ_≥‘(𝑃 pCnt (♯‘𝑘))))
67	33, 34, 66	leexp2ad 14261	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃↑(𝑃 pCnt (♯‘𝑘))) ≤ (𝑃↑(𝑃 pCnt (♯‘𝑋))))
68	29	simprd 499	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛))
69	24	fveqeq2d 6870	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ((♯‘𝑘) = (𝑃↑𝑛) ↔ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛)))
70	69	rexbidv 3185	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (∃𝑛 ∈ ℕ₀ (♯‘𝑘) = (𝑃↑𝑛) ↔ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛)))
71	68, 70	mpbird 259	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ∃𝑛 ∈ ℕ₀ (♯‘𝑘) = (𝑃↑𝑛))
72		pcprmpw 16910	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ ℙ ∧ (♯‘𝑘) ∈ ℕ) → (∃𝑛 ∈ ℕ₀ (♯‘𝑘) = (𝑃↑𝑛) ↔ (♯‘𝑘) = (𝑃↑(𝑃 pCnt (♯‘𝑘)))))
73	30, 41, 72	syl2anc 593	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (∃𝑛 ∈ ℕ₀ (♯‘𝑘) = (𝑃↑𝑛) ↔ (♯‘𝑘) = (𝑃↑(𝑃 pCnt (♯‘𝑘)))))
74	71, 73	mpbid 234	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑘) = (𝑃↑(𝑃 pCnt (♯‘𝑘))))
75		simplrr 787	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
76	67, 74, 75	3brtr4d 5129	. . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑘) ≤ (♯‘𝐻))
77	4	subgss 19160	. . . . . . . . . . . . 13 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋)
78	77	ad2antrl 738	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 ⊆ 𝑋)
79	10, 78	ssfid 9207	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 ∈ Fin)
80	79	adantr 484	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 ∈ Fin)
81		hashdom 14386	. . . . . . . . . 10 ⊢ ((𝑘 ∈ Fin ∧ 𝐻 ∈ Fin) → ((♯‘𝑘) ≤ (♯‘𝐻) ↔ 𝑘 ≼ 𝐻))
82	15, 80, 81	syl2anc 593	. . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ((♯‘𝑘) ≤ (♯‘𝐻) ↔ 𝑘 ≼ 𝐻))
83	76, 82	mpbid 234	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ≼ 𝐻)
84		sbth 9063	. . . . . . . 8 ⊢ ((𝐻 ≼ 𝑘 ∧ 𝑘 ≼ 𝐻) → 𝐻 ≈ 𝑘)
85	18, 83, 84	syl2anc 593	. . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 ≈ 𝑘)
86		fisseneq 9201	. . . . . . 7 ⊢ ((𝑘 ∈ Fin ∧ 𝐻 ⊆ 𝑘 ∧ 𝐻 ≈ 𝑘) → 𝐻 = 𝑘)
87	15, 16, 85, 86	syl3anc 1389	. . . . . 6 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 = 𝑘)
88	87	expr 460	. . . . 5 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ 𝑘 ∈ (SubGrp‘𝐺)) → ((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)) → 𝐻 = 𝑘))
89		eqid 2761	. . . . . . . . . . . . 13 ⊢ (𝐺 ↾_s 𝐻) = (𝐺 ↾_s 𝐻)
90	89	subgbas 19163	. . . . . . . . . . . 12 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 = (Base‘(𝐺 ↾_s 𝐻)))
91	90	ad2antrl 738	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 = (Base‘(𝐺 ↾_s 𝐻)))
92	91	fveq2d 6866	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (♯‘𝐻) = (♯‘(Base‘(𝐺 ↾_s 𝐻))))
93		simprr 782	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
94	92, 93	eqtr3d 2798	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
95		oveq2 7399	. . . . . . . . . 10 ⊢ (𝑛 = (𝑃 pCnt (♯‘𝑋)) → (𝑃↑𝑛) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
96	95	rspceeqv 3603	. . . . . . . . 9 ⊢ (((𝑃 pCnt (♯‘𝑋)) ∈ ℕ₀ ∧ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))) → ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑𝑛))
97	50, 94, 96	syl2anc 593	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑𝑛))
98	89	subggrp 19162	. . . . . . . . . 10 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → (𝐺 ↾_s 𝐻) ∈ Grp)
99	98	ad2antrl 738	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (𝐺 ↾_s 𝐻) ∈ Grp)
100	91, 79	eqeltrrd 2862	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (Base‘(𝐺 ↾_s 𝐻)) ∈ Fin)
101		eqid 2761	. . . . . . . . . 10 ⊢ (Base‘(𝐺 ↾_s 𝐻)) = (Base‘(𝐺 ↾_s 𝐻))
102	101	pgpfi 19636	. . . . . . . . 9 ⊢ (((𝐺 ↾_s 𝐻) ∈ Grp ∧ (Base‘(𝐺 ↾_s 𝐻)) ∈ Fin) → (𝑃 pGrp (𝐺 ↾_s 𝐻) ↔ (𝑃 ∈ ℙ ∧ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑𝑛))))
103	99, 100, 102	syl2anc 593	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (𝑃 pGrp (𝐺 ↾_s 𝐻) ↔ (𝑃 ∈ ℙ ∧ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑𝑛))))
104	8, 97, 103	mpbir2and 723	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝑃 pGrp (𝐺 ↾_s 𝐻))
105	104	adantr 484	. . . . . 6 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ 𝑘 ∈ (SubGrp‘𝐺)) → 𝑃 pGrp (𝐺 ↾_s 𝐻))
106		oveq2 7399	. . . . . . . 8 ⊢ (𝐻 = 𝑘 → (𝐺 ↾_s 𝐻) = (𝐺 ↾_s 𝑘))
107	106	breq2d 5109	. . . . . . 7 ⊢ (𝐻 = 𝑘 → (𝑃 pGrp (𝐺 ↾_s 𝐻) ↔ 𝑃 pGrp (𝐺 ↾_s 𝑘)))
108		eqimss 3992	. . . . . . . 8 ⊢ (𝐻 = 𝑘 → 𝐻 ⊆ 𝑘)
109	108	biantrurd 540	. . . . . . 7 ⊢ (𝐻 = 𝑘 → (𝑃 pGrp (𝐺 ↾_s 𝑘) ↔ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘))))
110	107, 109	bitrd 281	. . . . . 6 ⊢ (𝐻 = 𝑘 → (𝑃 pGrp (𝐺 ↾_s 𝐻) ↔ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘))))
111	105, 110	syl5ibcom 247	. . . . 5 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ 𝑘 ∈ (SubGrp‘𝐺)) → (𝐻 = 𝑘 → (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘))))
112	88, 111	impbid 214	. . . 4 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ 𝑘 ∈ (SubGrp‘𝐺)) → ((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)) ↔ 𝐻 = 𝑘))
113	112	ralrimiva 3153	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)) ↔ 𝐻 = 𝑘))
114		isslw 19639	. . 3 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) ↔ (𝑃 ∈ ℙ ∧ 𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)) ↔ 𝐻 = 𝑘)))
115	8, 9, 113, 114	syl3anbrc 1356	. 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 ∈ (𝑃 pSyl 𝐺))
116	7, 115	impbida 810	1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) → (𝐻 ∈ (𝑃 pSyl 𝐺) ↔ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ∀wral 3075 ∃wrex 3085 ⊆ wss 3902 ∅c0 4283 class class class wbr 5097 ‘cfv 6516 (class class class)co 7391 ≈ cen 8918 ≼ cdom 8919 Fincfn 8921 ≤ cle 11211 ℕcn 12204 ℕ₀cn0 12475 ℤcz 12562 ℤ_≥cuz 12833 ↑cexp 14068 ♯chash 14337 ∥ cdvds 16277 ℙcprime 16696 pCnt cpc 16863 Basecbs 17236 ↾_s cress 17257 0_gc0g 17459 Grpcgrp 18966 SubGrpcsubg 19153 pGrp cpgp 19557 pSyl cslw 19558

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-inf2 9590 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 ax-pre-sup 11145

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-disj 5065 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-se 5597 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-isom 6525 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-1o 8431 df-2o 8432 df-oadd 8435 df-omul 8436 df-er 8672 df-ec 8674 df-qs 8678 df-map 8804 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-sup 9382 df-inf 9383 df-oi 9452 df-dju 9853 df-card 9891 df-acn 9894 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-div 11839 df-nn 12205 df-2 12274 df-3 12275 df-n0 12476 df-xnn0 12549 df-z 12563 df-uz 12834 df-q 12944 df-rp 12988 df-fz 13507 df-fzo 13654 df-fl 13796 df-mod 13874 df-seq 14009 df-exp 14069 df-fac 14281 df-bc 14310 df-hash 14338 df-cj 15117 df-re 15118 df-im 15119 df-sqrt 15253 df-abs 15254 df-clim 15506 df-sum 15705 df-dvds 16278 df-gcd 16520 df-prm 16697 df-pc 16864 df-sets 17191 df-slot 17209 df-ndx 17221 df-base 17237 df-ress 17258 df-plusg 17290 df-0g 17461 df-mgm 18665 df-sgrp 18744 df-mnd 18760 df-submnd 18809 df-grp 18969 df-minusg 18970 df-sbg 18971 df-mulg 19101 df-subg 19156 df-eqg 19158 df-ghm 19245 df-ga 19321 df-od 19559 df-pgp 19561 df-slw 19562

This theorem is referenced by: sylow3lem1 19658

W3C validator