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 18744

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 487	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → 𝐻 ∈ (𝑃 pSyl 𝐺))
2		slwsubg 18729	. . . 4 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝐻 ∈ (SubGrp‘𝐺))
3	1, 2	syl 17	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → 𝐻 ∈ (SubGrp‘𝐺))
4		fislw.1	. . . 4 ⊢ 𝑋 = (Base‘𝐺)
5		simpl2 1188	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → 𝑋 ∈ Fin)
6	4, 5, 1	slwhash 18743	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
7	3, 6	jca 514	. 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))))
8		simpl3 1189	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝑃 ∈ ℙ)
9		simprl 769	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 ∈ (SubGrp‘𝐺))
10		simpl2 1188	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝑋 ∈ Fin)
11	10	adantr 483	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑋 ∈ Fin)
12		simprl 769	. . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ∈ (SubGrp‘𝐺))
13	4	subgss 18274	. . . . . . . . 9 ⊢ (𝑘 ∈ (SubGrp‘𝐺) → 𝑘 ⊆ 𝑋)
14	12, 13	syl 17	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ⊆ 𝑋)
15	11, 14	ssfid 8735	. . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ∈ Fin)
16		simprrl 779	. . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 ⊆ 𝑘)
17		ssdomg 8549	. . . . . . . . 9 ⊢ (𝑘 ∈ Fin → (𝐻 ⊆ 𝑘 → 𝐻 ≼ 𝑘))
18	15, 16, 17	sylc 65	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 ≼ 𝑘)
19		simprrr 780	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑃 pGrp (𝐺 ↾_s 𝑘))
20		eqid 2821	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐺 ↾_s 𝑘) = (𝐺 ↾_s 𝑘)
21	20	subggrp 18276	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (SubGrp‘𝐺) → (𝐺 ↾_s 𝑘) ∈ Grp)
22	12, 21	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝐺 ↾_s 𝑘) ∈ Grp)
23	20	subgbas 18277	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (SubGrp‘𝐺) → 𝑘 = (Base‘(𝐺 ↾_s 𝑘)))
24	12, 23	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 = (Base‘(𝐺 ↾_s 𝑘)))
25	24, 15	eqeltrrd 2914	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (Base‘(𝐺 ↾_s 𝑘)) ∈ Fin)
26		eqid 2821	. . . . . . . . . . . . . . . . 17 ⊢ (Base‘(𝐺 ↾_s 𝑘)) = (Base‘(𝐺 ↾_s 𝑘))
27	26	pgpfi 18724	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ↾_s 𝑘) ∈ Grp ∧ (Base‘(𝐺 ↾_s 𝑘)) ∈ Fin) → (𝑃 pGrp (𝐺 ↾_s 𝑘) ↔ (𝑃 ∈ ℙ ∧ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛))))
28	22, 25, 27	syl2anc 586	. . . . . . . . . . . . . . 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 497	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑃 ∈ ℙ)
31		prmnn 16012	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
32	30, 31	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑃 ∈ ℕ)
33	32	nnred 11647	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑃 ∈ ℝ)
34	32	nnge1d 11679	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 1 ≤ 𝑃)
35		eqid 2821	. . . . . . . . . . . . . . . . . 18 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
36	35	subg0cl 18281	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (SubGrp‘𝐺) → (0_g‘𝐺) ∈ 𝑘)
37	12, 36	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (0_g‘𝐺) ∈ 𝑘)
38	37	ne0d 4300	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ≠ ∅)
39		hashnncl 13721	. . . . . . . . . . . . . . . 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 16181	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑘)) ∈ ℕ₀)
43	42	nn0zd 12079	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑘)) ∈ ℤ)
44		simpl1 1187	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐺 ∈ Grp)
45	4	grpbn0 18126	. . . . . . . . . . . . . . . . 17 ⊢ (𝐺 ∈ Grp → 𝑋 ≠ ∅)
46	44, 45	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝑋 ≠ ∅)
47		hashnncl 13721	. . . . . . . . . . . . . . . . 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 16181	. . . . . . . . . . . . . 14 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (𝑃 pCnt (♯‘𝑋)) ∈ ℕ₀)
51	50	adantr 483	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑋)) ∈ ℕ₀)
52	51	nn0zd 12079	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑋)) ∈ ℤ)
53		oveq1 7157	. . . . . . . . . . . . . 14 ⊢ (𝑝 = 𝑃 → (𝑝 pCnt (♯‘𝑘)) = (𝑃 pCnt (♯‘𝑘)))
54		oveq1 7157	. . . . . . . . . . . . . 14 ⊢ (𝑝 = 𝑃 → (𝑝 pCnt (♯‘𝑋)) = (𝑃 pCnt (♯‘𝑋)))
55	53, 54	breq12d 5071	. . . . . . . . . . . . 13 ⊢ (𝑝 = 𝑃 → ((𝑝 pCnt (♯‘𝑘)) ≤ (𝑝 pCnt (♯‘𝑋)) ↔ (𝑃 pCnt (♯‘𝑘)) ≤ (𝑃 pCnt (♯‘𝑋))))
56	4	lagsubg 18336	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑘) ∥ (♯‘𝑋))
57	12, 11, 56	syl2anc 586	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑘) ∥ (♯‘𝑋))
58	41	nnzd 12080	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑘) ∈ ℤ)
59	49	adantr 483	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑋) ∈ ℕ)
60	59	nnzd 12080	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑋) ∈ ℤ)
61		pc2dvds 16209	. . . . . . . . . . . . . . 15 ⊢ (((♯‘𝑘) ∈ ℤ ∧ (♯‘𝑋) ∈ ℤ) → ((♯‘𝑘) ∥ (♯‘𝑋) ↔ ∀𝑝 ∈ ℙ (𝑝 pCnt (♯‘𝑘)) ≤ (𝑝 pCnt (♯‘𝑋))))
62	58, 60, 61	syl2anc 586	. . . . . . . . . . . . . 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 3624	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑘)) ≤ (𝑃 pCnt (♯‘𝑋)))
65		eluz2 12243	. . . . . . . . . . . 12 ⊢ ((𝑃 pCnt (♯‘𝑋)) ∈ (ℤ_≥‘(𝑃 pCnt (♯‘𝑘))) ↔ ((𝑃 pCnt (♯‘𝑘)) ∈ ℤ ∧ (𝑃 pCnt (♯‘𝑋)) ∈ ℤ ∧ (𝑃 pCnt (♯‘𝑘)) ≤ (𝑃 pCnt (♯‘𝑋))))
66	43, 52, 64, 65	syl3anbrc 1339	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑋)) ∈ (ℤ_≥‘(𝑃 pCnt (♯‘𝑘))))
67	33, 34, 66	leexp2ad 13611	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃↑(𝑃 pCnt (♯‘𝑘))) ≤ (𝑃↑(𝑃 pCnt (♯‘𝑋))))
68	29	simprd 498	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛))
69	24	fveqeq2d 6672	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ((♯‘𝑘) = (𝑃↑𝑛) ↔ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛)))
70	69	rexbidv 3297	. . . . . . . . . . . 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 16213	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ ℙ ∧ (♯‘𝑘) ∈ ℕ) → (∃𝑛 ∈ ℕ₀ (♯‘𝑘) = (𝑃↑𝑛) ↔ (♯‘𝑘) = (𝑃↑(𝑃 pCnt (♯‘𝑘)))))
73	30, 41, 72	syl2anc 586	. . . . . . . . . . 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 776	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
76	67, 74, 75	3brtr4d 5090	. . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑘) ≤ (♯‘𝐻))
77	4	subgss 18274	. . . . . . . . . . . . 13 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋)
78	77	ad2antrl 726	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 ⊆ 𝑋)
79	10, 78	ssfid 8735	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 ∈ Fin)
80	79	adantr 483	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 ∈ Fin)
81		hashdom 13734	. . . . . . . . . 10 ⊢ ((𝑘 ∈ Fin ∧ 𝐻 ∈ Fin) → ((♯‘𝑘) ≤ (♯‘𝐻) ↔ 𝑘 ≼ 𝐻))
82	15, 80, 81	syl2anc 586	. . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ((♯‘𝑘) ≤ (♯‘𝐻) ↔ 𝑘 ≼ 𝐻))
83	76, 82	mpbid 234	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ≼ 𝐻)
84		sbth 8631	. . . . . . . 8 ⊢ ((𝐻 ≼ 𝑘 ∧ 𝑘 ≼ 𝐻) → 𝐻 ≈ 𝑘)
85	18, 83, 84	syl2anc 586	. . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 ≈ 𝑘)
86		fisseneq 8723	. . . . . . 7 ⊢ ((𝑘 ∈ Fin ∧ 𝐻 ⊆ 𝑘 ∧ 𝐻 ≈ 𝑘) → 𝐻 = 𝑘)
87	15, 16, 85, 86	syl3anc 1367	. . . . . 6 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 = 𝑘)
88	87	expr 459	. . . . 5 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ 𝑘 ∈ (SubGrp‘𝐺)) → ((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)) → 𝐻 = 𝑘))
89		eqid 2821	. . . . . . . . . . . . 13 ⊢ (𝐺 ↾_s 𝐻) = (𝐺 ↾_s 𝐻)
90	89	subgbas 18277	. . . . . . . . . . . 12 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 = (Base‘(𝐺 ↾_s 𝐻)))
91	90	ad2antrl 726	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 = (Base‘(𝐺 ↾_s 𝐻)))
92	91	fveq2d 6668	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (♯‘𝐻) = (♯‘(Base‘(𝐺 ↾_s 𝐻))))
93		simprr 771	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
94	92, 93	eqtr3d 2858	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
95		oveq2 7158	. . . . . . . . . 10 ⊢ (𝑛 = (𝑃 pCnt (♯‘𝑋)) → (𝑃↑𝑛) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
96	95	rspceeqv 3637	. . . . . . . . 9 ⊢ (((𝑃 pCnt (♯‘𝑋)) ∈ ℕ₀ ∧ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))) → ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑𝑛))
97	50, 94, 96	syl2anc 586	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑𝑛))
98	89	subggrp 18276	. . . . . . . . . 10 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → (𝐺 ↾_s 𝐻) ∈ Grp)
99	98	ad2antrl 726	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (𝐺 ↾_s 𝐻) ∈ Grp)
100	91, 79	eqeltrrd 2914	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (Base‘(𝐺 ↾_s 𝐻)) ∈ Fin)
101		eqid 2821	. . . . . . . . . 10 ⊢ (Base‘(𝐺 ↾_s 𝐻)) = (Base‘(𝐺 ↾_s 𝐻))
102	101	pgpfi 18724	. . . . . . . . 9 ⊢ (((𝐺 ↾_s 𝐻) ∈ Grp ∧ (Base‘(𝐺 ↾_s 𝐻)) ∈ Fin) → (𝑃 pGrp (𝐺 ↾_s 𝐻) ↔ (𝑃 ∈ ℙ ∧ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑𝑛))))
103	99, 100, 102	syl2anc 586	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (𝑃 pGrp (𝐺 ↾_s 𝐻) ↔ (𝑃 ∈ ℙ ∧ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑𝑛))))
104	8, 97, 103	mpbir2and 711	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝑃 pGrp (𝐺 ↾_s 𝐻))
105	104	adantr 483	. . . . . 6 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ 𝑘 ∈ (SubGrp‘𝐺)) → 𝑃 pGrp (𝐺 ↾_s 𝐻))
106		oveq2 7158	. . . . . . . 8 ⊢ (𝐻 = 𝑘 → (𝐺 ↾_s 𝐻) = (𝐺 ↾_s 𝑘))
107	106	breq2d 5070	. . . . . . 7 ⊢ (𝐻 = 𝑘 → (𝑃 pGrp (𝐺 ↾_s 𝐻) ↔ 𝑃 pGrp (𝐺 ↾_s 𝑘)))
108		eqimss 4022	. . . . . . . 8 ⊢ (𝐻 = 𝑘 → 𝐻 ⊆ 𝑘)
109	108	biantrurd 535	. . . . . . 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 3182	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)) ↔ 𝐻 = 𝑘))
114		isslw 18727	. . 3 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) ↔ (𝑃 ∈ ℙ ∧ 𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)) ↔ 𝐻 = 𝑘)))
115	8, 9, 113, 114	syl3anbrc 1339	. 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 ∈ (𝑃 pSyl 𝐺))
116	7, 115	impbida 799	1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) → (𝐻 ∈ (𝑃 pSyl 𝐺) ↔ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 ∀wral 3138 ∃wrex 3139 ⊆ wss 3935 ∅c0 4290 class class class wbr 5058 ‘cfv 6349 (class class class)co 7150 ≈ cen 8500 ≼ cdom 8501 Fincfn 8503 ≤ cle 10670 ℕcn 11632 ℕ₀cn0 11891 ℤcz 11975 ℤ_≥cuz 12237 ↑cexp 13423 ♯chash 13684 ∥ cdvds 15601 ℙcprime 16009 pCnt cpc 16167 Basecbs 16477 ↾_s cress 16478 0_gc0g 16707 Grpcgrp 18097 SubGrpcsubg 18267 pGrp cpgp 18648 pSyl cslw 18649

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-inf2 9098 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 ax-pre-sup 10609

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-fal 1546 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-disj 5024 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-se 5509 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-isom 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-2o 8097 df-oadd 8100 df-omul 8101 df-er 8283 df-ec 8285 df-qs 8289 df-map 8402 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-sup 8900 df-inf 8901 df-oi 8968 df-dju 9324 df-card 9362 df-acn 9365 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-div 11292 df-nn 11633 df-2 11694 df-3 11695 df-n0 11892 df-xnn0 11962 df-z 11976 df-uz 12238 df-q 12343 df-rp 12384 df-fz 12887 df-fzo 13028 df-fl 13156 df-mod 13232 df-seq 13364 df-exp 13424 df-fac 13628 df-bc 13657 df-hash 13685 df-cj 14452 df-re 14453 df-im 14454 df-sqrt 14588 df-abs 14589 df-clim 14839 df-sum 15037 df-dvds 15602 df-gcd 15838 df-prm 16010 df-pc 16168 df-ndx 16480 df-slot 16481 df-base 16483 df-sets 16484 df-ress 16485 df-plusg 16572 df-0g 16709 df-mgm 17846 df-sgrp 17895 df-mnd 17906 df-submnd 17951 df-grp 18100 df-minusg 18101 df-sbg 18102 df-mulg 18219 df-subg 18270 df-eqg 18272 df-ghm 18350 df-ga 18414 df-od 18650 df-pgp 18652 df-slw 18653

This theorem is referenced by: sylow3lem1 18746

W3C validator