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 19591

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 485	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → 𝐻 ∈ (𝑃 pSyl 𝐺))
2		slwsubg 19576	. . . 4 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) → 𝐻 ∈ (SubGrp‘𝐺))
3	1, 2	syl 17	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → 𝐻 ∈ (SubGrp‘𝐺))
4		fislw.1	. . . 4 ⊢ 𝑋 = (Base‘𝐺)
5		simpl2 1199	. . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → 𝑋 ∈ Fin)
6	4, 5, 1	slwhash 19590	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
7	3, 6	jca 516	. 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ 𝐻 ∈ (𝑃 pSyl 𝐺)) → (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))))
8		simpl3 1200	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝑃 ∈ ℙ)
9		simprl 776	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 ∈ (SubGrp‘𝐺))
10		simpl2 1199	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝑋 ∈ Fin)
11	10	adantr 481	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑋 ∈ Fin)
12		simprl 776	. . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ∈ (SubGrp‘𝐺))
13	4	subgss 19094	. . . . . . . . 9 ⊢ (𝑘 ∈ (SubGrp‘𝐺) → 𝑘 ⊆ 𝑋)
14	12, 13	syl 17	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ⊆ 𝑋)
15	11, 14	ssfid 9169	. . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ∈ Fin)
16		simprrl 786	. . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 ⊆ 𝑘)
17		ssdomg 8937	. . . . . . . . 9 ⊢ (𝑘 ∈ Fin → (𝐻 ⊆ 𝑘 → 𝐻 ≼ 𝑘))
18	15, 16, 17	sylc 65	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 ≼ 𝑘)
19		simprrr 787	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑃 pGrp (𝐺 ↾_s 𝑘))
20		eqid 2739	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐺 ↾_s 𝑘) = (𝐺 ↾_s 𝑘)
21	20	subggrp 19096	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (SubGrp‘𝐺) → (𝐺 ↾_s 𝑘) ∈ Grp)
22	12, 21	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝐺 ↾_s 𝑘) ∈ Grp)
23	20	subgbas 19097	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ (SubGrp‘𝐺) → 𝑘 = (Base‘(𝐺 ↾_s 𝑘)))
24	12, 23	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 = (Base‘(𝐺 ↾_s 𝑘)))
25	24, 15	eqeltrrd 2840	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (Base‘(𝐺 ↾_s 𝑘)) ∈ Fin)
26		eqid 2739	. . . . . . . . . . . . . . . . 17 ⊢ (Base‘(𝐺 ↾_s 𝑘)) = (Base‘(𝐺 ↾_s 𝑘))
27	26	pgpfi 19571	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ↾_s 𝑘) ∈ Grp ∧ (Base‘(𝐺 ↾_s 𝑘)) ∈ Fin) → (𝑃 pGrp (𝐺 ↾_s 𝑘) ↔ (𝑃 ∈ ℙ ∧ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛))))
28	22, 25, 27	syl2anc 590	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pGrp (𝐺 ↾_s 𝑘) ↔ (𝑃 ∈ ℙ ∧ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛))))
29	19, 28	mpbid 233	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 ∈ ℙ ∧ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛)))
30	29	simpld 495	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑃 ∈ ℙ)
31		prmnn 16634	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
32	30, 31	syl 17	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑃 ∈ ℕ)
33	32	nnred 12180	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑃 ∈ ℝ)
34	32	nnge1d 12216	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 1 ≤ 𝑃)
35		eqid 2739	. . . . . . . . . . . . . . . . . 18 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
36	35	subg0cl 19101	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ (SubGrp‘𝐺) → (0_g‘𝐺) ∈ 𝑘)
37	12, 36	syl 17	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (0_g‘𝐺) ∈ 𝑘)
38	37	ne0d 4270	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ≠ ∅)
39		hashnncl 14319	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ Fin → ((♯‘𝑘) ∈ ℕ ↔ 𝑘 ≠ ∅))
40	15, 39	syl 17	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ((♯‘𝑘) ∈ ℕ ↔ 𝑘 ≠ ∅))
41	38, 40	mpbird 258	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑘) ∈ ℕ)
42	30, 41	pccld 16812	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑘)) ∈ ℕ₀)
43	42	nn0zd 12540	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑘)) ∈ ℤ)
44		simpl1 1198	. . . . . . . . . . . . . . . . 17 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐺 ∈ Grp)
45	4	grpbn0 18933	. . . . . . . . . . . . . . . . 17 ⊢ (𝐺 ∈ Grp → 𝑋 ≠ ∅)
46	44, 45	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝑋 ≠ ∅)
47		hashnncl 14319	. . . . . . . . . . . . . . . . 17 ⊢ (𝑋 ∈ Fin → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅))
48	10, 47	syl 17	. . . . . . . . . . . . . . . 16 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅))
49	46, 48	mpbird 258	. . . . . . . . . . . . . . 15 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (♯‘𝑋) ∈ ℕ)
50	8, 49	pccld 16812	. . . . . . . . . . . . . 14 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (𝑃 pCnt (♯‘𝑋)) ∈ ℕ₀)
51	50	adantr 481	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑋)) ∈ ℕ₀)
52	51	nn0zd 12540	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑋)) ∈ ℤ)
53		oveq1 7363	. . . . . . . . . . . . . 14 ⊢ (𝑝 = 𝑃 → (𝑝 pCnt (♯‘𝑘)) = (𝑃 pCnt (♯‘𝑘)))
54		oveq1 7363	. . . . . . . . . . . . . 14 ⊢ (𝑝 = 𝑃 → (𝑝 pCnt (♯‘𝑋)) = (𝑃 pCnt (♯‘𝑋)))
55	53, 54	breq12d 5085	. . . . . . . . . . . . 13 ⊢ (𝑝 = 𝑃 → ((𝑝 pCnt (♯‘𝑘)) ≤ (𝑝 pCnt (♯‘𝑋)) ↔ (𝑃 pCnt (♯‘𝑘)) ≤ (𝑃 pCnt (♯‘𝑋))))
56	4	lagsubg 19161	. . . . . . . . . . . . . . 15 ⊢ ((𝑘 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ Fin) → (♯‘𝑘) ∥ (♯‘𝑋))
57	12, 11, 56	syl2anc 590	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑘) ∥ (♯‘𝑋))
58	41	nnzd 12541	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑘) ∈ ℤ)
59	49	adantr 481	. . . . . . . . . . . . . . . 16 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑋) ∈ ℕ)
60	59	nnzd 12541	. . . . . . . . . . . . . . 15 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑋) ∈ ℤ)
61		pc2dvds 16841	. . . . . . . . . . . . . . 15 ⊢ (((♯‘𝑘) ∈ ℤ ∧ (♯‘𝑋) ∈ ℤ) → ((♯‘𝑘) ∥ (♯‘𝑋) ↔ ∀𝑝 ∈ ℙ (𝑝 pCnt (♯‘𝑘)) ≤ (𝑝 pCnt (♯‘𝑋))))
62	58, 60, 61	syl2anc 590	. . . . . . . . . . . . . 14 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ((♯‘𝑘) ∥ (♯‘𝑋) ↔ ∀𝑝 ∈ ℙ (𝑝 pCnt (♯‘𝑘)) ≤ (𝑝 pCnt (♯‘𝑋))))
63	57, 62	mpbid 233	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ∀𝑝 ∈ ℙ (𝑝 pCnt (♯‘𝑘)) ≤ (𝑝 pCnt (♯‘𝑋)))
64	55, 63, 30	rspcdva 3561	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑘)) ≤ (𝑃 pCnt (♯‘𝑋)))
65		eluz2 12785	. . . . . . . . . . . 12 ⊢ ((𝑃 pCnt (♯‘𝑋)) ∈ (ℤ_≥‘(𝑃 pCnt (♯‘𝑘))) ↔ ((𝑃 pCnt (♯‘𝑘)) ∈ ℤ ∧ (𝑃 pCnt (♯‘𝑋)) ∈ ℤ ∧ (𝑃 pCnt (♯‘𝑘)) ≤ (𝑃 pCnt (♯‘𝑋))))
66	43, 52, 64, 65	syl3anbrc 1350	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃 pCnt (♯‘𝑋)) ∈ (ℤ_≥‘(𝑃 pCnt (♯‘𝑘))))
67	33, 34, 66	leexp2ad 14207	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (𝑃↑(𝑃 pCnt (♯‘𝑘))) ≤ (𝑃↑(𝑃 pCnt (♯‘𝑋))))
68	29	simprd 496	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛))
69	24	fveqeq2d 6835	. . . . . . . . . . . . 13 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ((♯‘𝑘) = (𝑃↑𝑛) ↔ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛)))
70	69	rexbidv 3163	. . . . . . . . . . . 12 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (∃𝑛 ∈ ℕ₀ (♯‘𝑘) = (𝑃↑𝑛) ↔ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝑘))) = (𝑃↑𝑛)))
71	68, 70	mpbird 258	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ∃𝑛 ∈ ℕ₀ (♯‘𝑘) = (𝑃↑𝑛))
72		pcprmpw 16845	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ ℙ ∧ (♯‘𝑘) ∈ ℕ) → (∃𝑛 ∈ ℕ₀ (♯‘𝑘) = (𝑃↑𝑛) ↔ (♯‘𝑘) = (𝑃↑(𝑃 pCnt (♯‘𝑘)))))
73	30, 41, 72	syl2anc 590	. . . . . . . . . . 11 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (∃𝑛 ∈ ℕ₀ (♯‘𝑘) = (𝑃↑𝑛) ↔ (♯‘𝑘) = (𝑃↑(𝑃 pCnt (♯‘𝑘)))))
74	71, 73	mpbid 233	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑘) = (𝑃↑(𝑃 pCnt (♯‘𝑘))))
75		simplrr 783	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
76	67, 74, 75	3brtr4d 5104	. . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → (♯‘𝑘) ≤ (♯‘𝐻))
77	4	subgss 19094	. . . . . . . . . . . . 13 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋)
78	77	ad2antrl 734	. . . . . . . . . . . 12 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 ⊆ 𝑋)
79	10, 78	ssfid 9169	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 ∈ Fin)
80	79	adantr 481	. . . . . . . . . 10 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 ∈ Fin)
81		hashdom 14332	. . . . . . . . . 10 ⊢ ((𝑘 ∈ Fin ∧ 𝐻 ∈ Fin) → ((♯‘𝑘) ≤ (♯‘𝐻) ↔ 𝑘 ≼ 𝐻))
82	15, 80, 81	syl2anc 590	. . . . . . . . 9 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → ((♯‘𝑘) ≤ (♯‘𝐻) ↔ 𝑘 ≼ 𝐻))
83	76, 82	mpbid 233	. . . . . . . 8 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝑘 ≼ 𝐻)
84		sbth 9025	. . . . . . . 8 ⊢ ((𝐻 ≼ 𝑘 ∧ 𝑘 ≼ 𝐻) → 𝐻 ≈ 𝑘)
85	18, 83, 84	syl2anc 590	. . . . . . 7 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 ≈ 𝑘)
86		fisseneq 9163	. . . . . . 7 ⊢ ((𝑘 ∈ Fin ∧ 𝐻 ⊆ 𝑘 ∧ 𝐻 ≈ 𝑘) → 𝐻 = 𝑘)
87	15, 16, 85, 86	syl3anc 1379	. . . . . 6 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ (𝑘 ∈ (SubGrp‘𝐺) ∧ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)))) → 𝐻 = 𝑘)
88	87	expr 457	. . . . 5 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ 𝑘 ∈ (SubGrp‘𝐺)) → ((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)) → 𝐻 = 𝑘))
89		eqid 2739	. . . . . . . . . . . . 13 ⊢ (𝐺 ↾_s 𝐻) = (𝐺 ↾_s 𝐻)
90	89	subgbas 19097	. . . . . . . . . . . 12 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 = (Base‘(𝐺 ↾_s 𝐻)))
91	90	ad2antrl 734	. . . . . . . . . . 11 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 = (Base‘(𝐺 ↾_s 𝐻)))
92	91	fveq2d 6831	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (♯‘𝐻) = (♯‘(Base‘(𝐺 ↾_s 𝐻))))
93		simprr 778	. . . . . . . . . 10 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
94	92, 93	eqtr3d 2776	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
95		oveq2 7364	. . . . . . . . . 10 ⊢ (𝑛 = (𝑃 pCnt (♯‘𝑋)) → (𝑃↑𝑛) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
96	95	rspceeqv 3583	. . . . . . . . 9 ⊢ (((𝑃 pCnt (♯‘𝑋)) ∈ ℕ₀ ∧ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑(𝑃 pCnt (♯‘𝑋)))) → ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑𝑛))
97	50, 94, 96	syl2anc 590	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑𝑛))
98	89	subggrp 19096	. . . . . . . . . 10 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → (𝐺 ↾_s 𝐻) ∈ Grp)
99	98	ad2antrl 734	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (𝐺 ↾_s 𝐻) ∈ Grp)
100	91, 79	eqeltrrd 2840	. . . . . . . . 9 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (Base‘(𝐺 ↾_s 𝐻)) ∈ Fin)
101		eqid 2739	. . . . . . . . . 10 ⊢ (Base‘(𝐺 ↾_s 𝐻)) = (Base‘(𝐺 ↾_s 𝐻))
102	101	pgpfi 19571	. . . . . . . . 9 ⊢ (((𝐺 ↾_s 𝐻) ∈ Grp ∧ (Base‘(𝐺 ↾_s 𝐻)) ∈ Fin) → (𝑃 pGrp (𝐺 ↾_s 𝐻) ↔ (𝑃 ∈ ℙ ∧ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑𝑛))))
103	99, 100, 102	syl2anc 590	. . . . . . . 8 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → (𝑃 pGrp (𝐺 ↾_s 𝐻) ↔ (𝑃 ∈ ℙ ∧ ∃𝑛 ∈ ℕ₀ (♯‘(Base‘(𝐺 ↾_s 𝐻))) = (𝑃↑𝑛))))
104	8, 97, 103	mpbir2and 719	. . . . . . 7 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝑃 pGrp (𝐺 ↾_s 𝐻))
105	104	adantr 481	. . . . . 6 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ 𝑘 ∈ (SubGrp‘𝐺)) → 𝑃 pGrp (𝐺 ↾_s 𝐻))
106		oveq2 7364	. . . . . . . 8 ⊢ (𝐻 = 𝑘 → (𝐺 ↾_s 𝐻) = (𝐺 ↾_s 𝑘))
107	106	breq2d 5084	. . . . . . 7 ⊢ (𝐻 = 𝑘 → (𝑃 pGrp (𝐺 ↾_s 𝐻) ↔ 𝑃 pGrp (𝐺 ↾_s 𝑘)))
108		eqimss 3973	. . . . . . . 8 ⊢ (𝐻 = 𝑘 → 𝐻 ⊆ 𝑘)
109	108	biantrurd 537	. . . . . . 7 ⊢ (𝐻 = 𝑘 → (𝑃 pGrp (𝐺 ↾_s 𝑘) ↔ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘))))
110	107, 109	bitrd 280	. . . . . 6 ⊢ (𝐻 = 𝑘 → (𝑃 pGrp (𝐺 ↾_s 𝐻) ↔ (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘))))
111	105, 110	syl5ibcom 246	. . . . 5 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ 𝑘 ∈ (SubGrp‘𝐺)) → (𝐻 = 𝑘 → (𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘))))
112	88, 111	impbid 213	. . . 4 ⊢ ((((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) ∧ 𝑘 ∈ (SubGrp‘𝐺)) → ((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)) ↔ 𝐻 = 𝑘))
113	112	ralrimiva 3131	. . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)) ↔ 𝐻 = 𝑘))
114		isslw 19574	. . 3 ⊢ (𝐻 ∈ (𝑃 pSyl 𝐺) ↔ (𝑃 ∈ ℙ ∧ 𝐻 ∈ (SubGrp‘𝐺) ∧ ∀𝑘 ∈ (SubGrp‘𝐺)((𝐻 ⊆ 𝑘 ∧ 𝑃 pGrp (𝐺 ↾_s 𝑘)) ↔ 𝐻 = 𝑘)))
115	8, 9, 113, 114	syl3anbrc 1350	. 2 ⊢ (((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) ∧ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))) → 𝐻 ∈ (𝑃 pSyl 𝐺))
116	7, 115	impbida 806	1 ⊢ ((𝐺 ∈ Grp ∧ 𝑋 ∈ Fin ∧ 𝑃 ∈ ℙ) → (𝐻 ∈ (𝑃 pSyl 𝐺) ↔ (𝐻 ∈ (SubGrp‘𝐺) ∧ (♯‘𝐻) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ≠ wne 2934 ∀wral 3053 ∃wrex 3063 ⊆ wss 3883 ∅c0 4261 class class class wbr 5072 ‘cfv 6485 (class class class)co 7356 ≈ cen 8880 ≼ cdom 8881 Fincfn 8883 ≤ cle 11171 ℕcn 12165 ℕ₀cn0 12428 ℤcz 12515 ℤ_≥cuz 12779 ↑cexp 14014 ♯chash 14283 ∥ cdvds 16212 ℙcprime 16631 pCnt cpc 16798 Basecbs 17170 ↾_s cress 17191 0_gc0g 17393 Grpcgrp 18900 SubGrpcsubg 19087 pGrp cpgp 19492 pSyl cslw 19493

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-inf2 9553 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 ax-pre-sup 11107

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-disj 5040 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-se 5572 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-isom 6494 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-oadd 8399 df-omul 8400 df-er 8633 df-ec 8635 df-qs 8639 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-sup 9345 df-inf 9346 df-oi 9415 df-dju 9816 df-card 9854 df-acn 9857 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-div 11799 df-nn 12166 df-2 12235 df-3 12236 df-n0 12429 df-xnn0 12502 df-z 12516 df-uz 12780 df-q 12890 df-rp 12934 df-fz 13453 df-fzo 13600 df-fl 13742 df-mod 13820 df-seq 13955 df-exp 14015 df-fac 14227 df-bc 14256 df-hash 14284 df-cj 15052 df-re 15053 df-im 15054 df-sqrt 15188 df-abs 15189 df-clim 15441 df-sum 15640 df-dvds 16213 df-gcd 16455 df-prm 16632 df-pc 16799 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-0g 17395 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-submnd 18743 df-grp 18903 df-minusg 18904 df-sbg 18905 df-mulg 19035 df-subg 19090 df-eqg 19092 df-ghm 19179 df-ga 19256 df-od 19494 df-pgp 19496 df-slw 19497

This theorem is referenced by: sylow3lem1 19593

W3C validator