sylow2blem3 - Metamath Proof Explorer

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

Theorem sylow2blem3 19595

Description: Sylow's second theorem. Putting together the results of sylow2a 19592 and the orbit-stabilizer theorem to show that 𝑃 does not divide the set of all fixed points under the group action, we get that there is a fixed point of the group action, so that there is some 𝑔 ∈ 𝑋 with ℎ𝑔𝐾 = 𝑔𝐾 for all ℎ ∈ 𝐻. This implies that inv_g(𝑔)ℎ𝑔 ∈ 𝐾, so ℎ is in the conjugated subgroup 𝑔𝐾inv_g(𝑔). (Contributed by Mario Carneiro, 18-Jan-2015.)

**Hypotheses**
Ref	Expression
sylow2b.x	⊢ 𝑋 = (Base‘𝐺)
sylow2b.xf	⊢ (𝜑 → 𝑋 ∈ Fin)
sylow2b.h	⊢ (𝜑 → 𝐻 ∈ (SubGrp‘𝐺))
sylow2b.k	⊢ (𝜑 → 𝐾 ∈ (SubGrp‘𝐺))
sylow2b.a	⊢ + = (+_g‘𝐺)
sylow2b.r	⊢ ∼ = (𝐺 ~_QG 𝐾)
sylow2b.m	⊢ · = (𝑥 ∈ 𝐻, 𝑦 ∈ (𝑋 / ∼ ) ↦ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))
sylow2blem3.hp	⊢ (𝜑 → 𝑃 pGrp (𝐺 ↾_s 𝐻))
sylow2blem3.kn	⊢ (𝜑 → (♯‘𝐾) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
sylow2blem3.d	⊢ − = (-_g‘𝐺)

**Assertion**
Ref	Expression
sylow2blem3	⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))

Distinct variable groups: 𝑥,𝑔,𝑦,𝑧,𝐺 𝑔,𝐾,𝑥,𝑦,𝑧 · ,𝑔,𝑥,𝑦,𝑧 + ,𝑔,𝑥,𝑦,𝑧 ∼ ,𝑔,𝑥,𝑦,𝑧 𝜑,𝑔,𝑧 𝑥, − ,𝑧 𝑔,𝐻,𝑥,𝑦,𝑧 𝑔,𝑋,𝑥,𝑦,𝑧 Allowed substitution hints: 𝜑(𝑥,𝑦) 𝑃(𝑥,𝑦,𝑧,𝑔) − (𝑦,𝑔)

Proof of Theorem sylow2blem3 Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sylow2blem3.hp	. . . . . . . . 9 ⊢ (𝜑 → 𝑃 pGrp (𝐺 ↾_s 𝐻))
2		pgpprm 19566	. . . . . . . . 9 ⊢ (𝑃 pGrp (𝐺 ↾_s 𝐻) → 𝑃 ∈ ℙ)
3	1, 2	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑃 ∈ ℙ)
4		sylow2b.h	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐻 ∈ (SubGrp‘𝐺))
5		subgrcl 19105	. . . . . . . . . . 11 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
6	4, 5	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 ∈ Grp)
7		sylow2b.x	. . . . . . . . . . 11 ⊢ 𝑋 = (Base‘𝐺)
8	7	grpbn0 18940	. . . . . . . . . 10 ⊢ (𝐺 ∈ Grp → 𝑋 ≠ ∅)
9	6, 8	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ≠ ∅)
10		sylow2b.xf	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ Fin)
11		hashnncl 14326	. . . . . . . . . 10 ⊢ (𝑋 ∈ Fin → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅))
12	10, 11	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅))
13	9, 12	mpbird 258	. . . . . . . 8 ⊢ (𝜑 → (♯‘𝑋) ∈ ℕ)
14		pcndvds2 16837	. . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ (♯‘𝑋) ∈ ℕ) → ¬ 𝑃 ∥ ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋)))))
15	3, 13, 14	syl2anc 590	. . . . . . 7 ⊢ (𝜑 → ¬ 𝑃 ∥ ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋)))))
16		sylow2b.r	. . . . . . . . . . 11 ⊢ ∼ = (𝐺 ~_QG 𝐾)
17		sylow2b.k	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐾 ∈ (SubGrp‘𝐺))
18	7, 16, 17, 10	lagsubg2 19167	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝑋) = ((♯‘(𝑋 / ∼ )) · (♯‘𝐾)))
19	18	oveq1d 7378	. . . . . . . . 9 ⊢ (𝜑 → ((♯‘𝑋) / (♯‘𝐾)) = (((♯‘(𝑋 / ∼ )) · (♯‘𝐾)) / (♯‘𝐾)))
20		sylow2blem3.kn	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝐾) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
21	20	oveq2d 7379	. . . . . . . . 9 ⊢ (𝜑 → ((♯‘𝑋) / (♯‘𝐾)) = ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋)))))
22		pwfi 9226	. . . . . . . . . . . . . 14 ⊢ (𝑋 ∈ Fin ↔ 𝒫 𝑋 ∈ Fin)
23	10, 22	sylib 219	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝒫 𝑋 ∈ Fin)
24	7, 16	eqger 19151	. . . . . . . . . . . . . . 15 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → ∼ Er 𝑋)
25	17, 24	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∼ Er 𝑋)
26	25	qsss 8719	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑋 / ∼ ) ⊆ 𝒫 𝑋)
27	23, 26	ssfid 9176	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑋 / ∼ ) ∈ Fin)
28		hashcl 14316	. . . . . . . . . . . 12 ⊢ ((𝑋 / ∼ ) ∈ Fin → (♯‘(𝑋 / ∼ )) ∈ ℕ₀)
29	27, 28	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (♯‘(𝑋 / ∼ )) ∈ ℕ₀)
30	29	nn0cnd 12498	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘(𝑋 / ∼ )) ∈ ℂ)
31		eqid 2740	. . . . . . . . . . . . . . 15 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
32	31	subg0cl 19108	. . . . . . . . . . . . . 14 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → (0_g‘𝐺) ∈ 𝐾)
33	17, 32	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → (0_g‘𝐺) ∈ 𝐾)
34	33	ne0d 4277	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐾 ≠ ∅)
35	7	subgss 19101	. . . . . . . . . . . . . . 15 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → 𝐾 ⊆ 𝑋)
36	17, 35	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐾 ⊆ 𝑋)
37	10, 36	ssfid 9176	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐾 ∈ Fin)
38		hashnncl 14326	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ Fin → ((♯‘𝐾) ∈ ℕ ↔ 𝐾 ≠ ∅))
39	37, 38	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → ((♯‘𝐾) ∈ ℕ ↔ 𝐾 ≠ ∅))
40	34, 39	mpbird 258	. . . . . . . . . . 11 ⊢ (𝜑 → (♯‘𝐾) ∈ ℕ)
41	40	nncnd 12188	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝐾) ∈ ℂ)
42	40	nnne0d 12225	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝐾) ≠ 0)
43	30, 41, 42	divcan4d 11935	. . . . . . . . 9 ⊢ (𝜑 → (((♯‘(𝑋 / ∼ )) · (♯‘𝐾)) / (♯‘𝐾)) = (♯‘(𝑋 / ∼ )))
44	19, 21, 43	3eqtr3d 2783	. . . . . . . 8 ⊢ (𝜑 → ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋)))) = (♯‘(𝑋 / ∼ )))
45	44	breq2d 5091	. . . . . . 7 ⊢ (𝜑 → (𝑃 ∥ ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋)))) ↔ 𝑃 ∥ (♯‘(𝑋 / ∼ ))))
46	15, 45	mtbid 325	. . . . . 6 ⊢ (𝜑 → ¬ 𝑃 ∥ (♯‘(𝑋 / ∼ )))
47		prmz 16642	. . . . . . . 8 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
48	3, 47	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑃 ∈ ℤ)
49	29	nn0zd 12547	. . . . . . 7 ⊢ (𝜑 → (♯‘(𝑋 / ∼ )) ∈ ℤ)
50		ssrab2 4018	. . . . . . . . . 10 ⊢ {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ⊆ (𝑋 / ∼ )
51		ssfi 9104	. . . . . . . . . 10 ⊢ (((𝑋 / ∼ ) ∈ Fin ∧ {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ⊆ (𝑋 / ∼ )) → {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ∈ Fin)
52	27, 50, 51	sylancl 592	. . . . . . . . 9 ⊢ (𝜑 → {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ∈ Fin)
53		hashcl 14316	. . . . . . . . 9 ⊢ ({𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ∈ Fin → (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) ∈ ℕ₀)
54	52, 53	syl 17	. . . . . . . 8 ⊢ (𝜑 → (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) ∈ ℕ₀)
55	54	nn0zd 12547	. . . . . . 7 ⊢ (𝜑 → (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) ∈ ℤ)
56		eqid 2740	. . . . . . . 8 ⊢ (Base‘(𝐺 ↾_s 𝐻)) = (Base‘(𝐺 ↾_s 𝐻))
57		sylow2b.a	. . . . . . . . 9 ⊢ + = (+_g‘𝐺)
58		sylow2b.m	. . . . . . . . 9 ⊢ · = (𝑥 ∈ 𝐻, 𝑦 ∈ (𝑋 / ∼ ) ↦ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))
59	7, 10, 4, 17, 57, 16, 58	sylow2blem2 19594	. . . . . . . 8 ⊢ (𝜑 → · ∈ ((𝐺 ↾_s 𝐻) GrpAct (𝑋 / ∼ )))
60		eqid 2740	. . . . . . . . . . 11 ⊢ (𝐺 ↾_s 𝐻) = (𝐺 ↾_s 𝐻)
61	60	subgbas 19104	. . . . . . . . . 10 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 = (Base‘(𝐺 ↾_s 𝐻)))
62	4, 61	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐻 = (Base‘(𝐺 ↾_s 𝐻)))
63	7	subgss 19101	. . . . . . . . . . 11 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋)
64	4, 63	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐻 ⊆ 𝑋)
65	10, 64	ssfid 9176	. . . . . . . . 9 ⊢ (𝜑 → 𝐻 ∈ Fin)
66	62, 65	eqeltrrd 2841	. . . . . . . 8 ⊢ (𝜑 → (Base‘(𝐺 ↾_s 𝐻)) ∈ Fin)
67		eqid 2740	. . . . . . . 8 ⊢ {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} = {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}
68		eqid 2740	. . . . . . . 8 ⊢ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (𝑋 / ∼ ) ∧ ∃𝑔 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑔 · 𝑥) = 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (𝑋 / ∼ ) ∧ ∃𝑔 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑔 · 𝑥) = 𝑦)}
69	56, 59, 1, 66, 27, 67, 68	sylow2a 19592	. . . . . . 7 ⊢ (𝜑 → 𝑃 ∥ ((♯‘(𝑋 / ∼ )) − (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧})))
70		dvdssub2 16268	. . . . . . 7 ⊢ (((𝑃 ∈ ℤ ∧ (♯‘(𝑋 / ∼ )) ∈ ℤ ∧ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) ∈ ℤ) ∧ 𝑃 ∥ ((♯‘(𝑋 / ∼ )) − (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}))) → (𝑃 ∥ (♯‘(𝑋 / ∼ )) ↔ 𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧})))
71	48, 49, 55, 69, 70	syl31anc 1381	. . . . . 6 ⊢ (𝜑 → (𝑃 ∥ (♯‘(𝑋 / ∼ )) ↔ 𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧})))
72	46, 71	mtbid 325	. . . . 5 ⊢ (𝜑 → ¬ 𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}))
73		hasheq0 14323	. . . . . . . 8 ⊢ ({𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ∈ Fin → ((♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) = 0 ↔ {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} = ∅))
74	52, 73	syl 17	. . . . . . 7 ⊢ (𝜑 → ((♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) = 0 ↔ {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} = ∅))
75		dvds0 16238	. . . . . . . . 9 ⊢ (𝑃 ∈ ℤ → 𝑃 ∥ 0)
76	48, 75	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑃 ∥ 0)
77		breq2 5083	. . . . . . . 8 ⊢ ((♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) = 0 → (𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) ↔ 𝑃 ∥ 0))
78	76, 77	syl5ibrcom 248	. . . . . . 7 ⊢ (𝜑 → ((♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) = 0 → 𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧})))
79	74, 78	sylbird 261	. . . . . 6 ⊢ (𝜑 → ({𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} = ∅ → 𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧})))
80	79	necon3bd 2949	. . . . 5 ⊢ (𝜑 → (¬ 𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) → {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ≠ ∅))
81	72, 80	mpd 15	. . . 4 ⊢ (𝜑 → {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ≠ ∅)
82		rabn0 4324	. . . 4 ⊢ ({𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ≠ ∅ ↔ ∃𝑧 ∈ (𝑋 / ∼ )∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧)
83	81, 82	sylib 219	. . 3 ⊢ (𝜑 → ∃𝑧 ∈ (𝑋 / ∼ )∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧)
84	62	raleqdv 3298	. . . 4 ⊢ (𝜑 → (∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 ↔ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧))
85	84	rexbidv 3164	. . 3 ⊢ (𝜑 → (∃𝑧 ∈ (𝑋 / ∼ )∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 ↔ ∃𝑧 ∈ (𝑋 / ∼ )∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧))
86	83, 85	mpbird 258	. 2 ⊢ (𝜑 → ∃𝑧 ∈ (𝑋 / ∼ )∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧)
87		vex 3436	. . . . 5 ⊢ 𝑧 ∈ V
88	87	elqs 8708	. . . 4 ⊢ (𝑧 ∈ (𝑋 / ∼ ) ↔ ∃𝑔 ∈ 𝑋 𝑧 = [𝑔] ∼ )
89		simplrr 783	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑧 = [𝑔] ∼ )
90	89	oveq2d 7379	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑢 · 𝑧) = (𝑢 · [𝑔] ∼ ))
91		simprr 778	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑢 · 𝑧) = 𝑧)
92		simpll 772	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝜑)
93		simprl 776	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑢 ∈ 𝐻)
94		simplrl 782	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑔 ∈ 𝑋)
95	7, 10, 4, 17, 57, 16, 58	sylow2blem1 19593	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐻 ∧ 𝑔 ∈ 𝑋) → (𝑢 · [𝑔] ∼ ) = [(𝑢 + 𝑔)] ∼ )
96	92, 93, 94, 95	syl3anc 1379	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑢 · [𝑔] ∼ ) = [(𝑢 + 𝑔)] ∼ )
97	90, 91, 96	3eqtr3d 2783	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑧 = [(𝑢 + 𝑔)] ∼ )
98	89, 97	eqtr3d 2777	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → [𝑔] ∼ = [(𝑢 + 𝑔)] ∼ )
99	25	ad2antrr 732	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ∼ Er 𝑋)
100	99, 94	erth 8695	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑔 ∼ (𝑢 + 𝑔) ↔ [𝑔] ∼ = [(𝑢 + 𝑔)] ∼ ))
101	98, 100	mpbird 258	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑔 ∼ (𝑢 + 𝑔))
102	6	ad2antrr 732	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝐺 ∈ Grp)
103	36	ad2antrr 732	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝐾 ⊆ 𝑋)
104		eqid 2740	. . . . . . . . . . . . . . . . . . . 20 ⊢ (inv_g‘𝐺) = (inv_g‘𝐺)
105	7, 104, 57, 16	eqgval 19150	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ Grp ∧ 𝐾 ⊆ 𝑋) → (𝑔 ∼ (𝑢 + 𝑔) ↔ (𝑔 ∈ 𝑋 ∧ (𝑢 + 𝑔) ∈ 𝑋 ∧ (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) ∈ 𝐾)))
106	102, 103, 105	syl2anc 590	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑔 ∼ (𝑢 + 𝑔) ↔ (𝑔 ∈ 𝑋 ∧ (𝑢 + 𝑔) ∈ 𝑋 ∧ (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) ∈ 𝐾)))
107	101, 106	mpbid 233	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑔 ∈ 𝑋 ∧ (𝑢 + 𝑔) ∈ 𝑋 ∧ (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) ∈ 𝐾))
108	107	simp3d 1150	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) ∈ 𝐾)
109		oveq2 7371	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) → (𝑔 + 𝑥) = (𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))))
110	109	oveq1d 7378	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) → ((𝑔 + 𝑥) − 𝑔) = ((𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) − 𝑔))
111		eqid 2740	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) = (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))
112		ovex 7396	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) − 𝑔) ∈ V
113	110, 111, 112	fvmpt 6942	. . . . . . . . . . . . . . . 16 ⊢ ((((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) ∈ 𝐾 → ((𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))‘(((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) = ((𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) − 𝑔))
114	108, 113	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))‘(((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) = ((𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) − 𝑔))
115	7, 57, 31, 104	grprinv 18964	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ Grp ∧ 𝑔 ∈ 𝑋) → (𝑔 + ((inv_g‘𝐺)‘𝑔)) = (0_g‘𝐺))
116	102, 94, 115	syl2anc 590	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑔 + ((inv_g‘𝐺)‘𝑔)) = (0_g‘𝐺))
117	116	oveq1d 7378	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑔 + ((inv_g‘𝐺)‘𝑔)) + (𝑢 + 𝑔)) = ((0_g‘𝐺) + (𝑢 + 𝑔)))
118	7, 104	grpinvcl 18961	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ Grp ∧ 𝑔 ∈ 𝑋) → ((inv_g‘𝐺)‘𝑔) ∈ 𝑋)
119	102, 94, 118	syl2anc 590	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((inv_g‘𝐺)‘𝑔) ∈ 𝑋)
120	64	ad2antrr 732	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝐻 ⊆ 𝑋)
121	120, 93	sseldd 3923	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑢 ∈ 𝑋)
122	7, 57	grpcl 18915	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ 𝑋 ∧ 𝑔 ∈ 𝑋) → (𝑢 + 𝑔) ∈ 𝑋)
123	102, 121, 94, 122	syl3anc 1379	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑢 + 𝑔) ∈ 𝑋)
124	7, 57	grpass 18916	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺 ∈ Grp ∧ (𝑔 ∈ 𝑋 ∧ ((inv_g‘𝐺)‘𝑔) ∈ 𝑋 ∧ (𝑢 + 𝑔) ∈ 𝑋)) → ((𝑔 + ((inv_g‘𝐺)‘𝑔)) + (𝑢 + 𝑔)) = (𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))))
125	102, 94, 119, 123, 124	syl13anc 1380	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑔 + ((inv_g‘𝐺)‘𝑔)) + (𝑢 + 𝑔)) = (𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))))
126	7, 57, 31	grplid 18941	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺 ∈ Grp ∧ (𝑢 + 𝑔) ∈ 𝑋) → ((0_g‘𝐺) + (𝑢 + 𝑔)) = (𝑢 + 𝑔))
127	102, 123, 126	syl2anc 590	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((0_g‘𝐺) + (𝑢 + 𝑔)) = (𝑢 + 𝑔))
128	117, 125, 127	3eqtr3d 2783	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) = (𝑢 + 𝑔))
129	128	oveq1d 7378	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) − 𝑔) = ((𝑢 + 𝑔) − 𝑔))
130		sylow2blem3.d	. . . . . . . . . . . . . . . . 17 ⊢ − = (-_g‘𝐺)
131	7, 57, 130	grppncan 19005	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ 𝑋 ∧ 𝑔 ∈ 𝑋) → ((𝑢 + 𝑔) − 𝑔) = 𝑢)
132	102, 121, 94, 131	syl3anc 1379	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑢 + 𝑔) − 𝑔) = 𝑢)
133	114, 129, 132	3eqtrd 2779	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))‘(((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) = 𝑢)
134		ovex 7396	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔 + 𝑥) − 𝑔) ∈ V
135	134, 111	fnmpti 6635	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) Fn 𝐾
136		fnfvelrn 7028	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) Fn 𝐾 ∧ (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) ∈ 𝐾) → ((𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))‘(((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
137	135, 108, 136	sylancr 593	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))‘(((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
138	133, 137	eqeltrrd 2841	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑢 ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
139	138	expr 457	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ 𝑢 ∈ 𝐻) → ((𝑢 · 𝑧) = 𝑧 → 𝑢 ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))))
140	139	ralimdva 3152	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) → (∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 → ∀𝑢 ∈ 𝐻 𝑢 ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))))
141	140	imp 407	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ ∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧) → ∀𝑢 ∈ 𝐻 𝑢 ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
142	141	an32s 658	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧) ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) → ∀𝑢 ∈ 𝐻 𝑢 ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
143		dfss3 3911	. . . . . . . . 9 ⊢ (𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ↔ ∀𝑢 ∈ 𝐻 𝑢 ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
144	142, 143	sylibr 235	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧) ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) → 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
145	144	expr 457	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧) ∧ 𝑔 ∈ 𝑋) → (𝑧 = [𝑔] ∼ → 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))))
146	145	reximdva 3153	. . . . . 6 ⊢ ((𝜑 ∧ ∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧) → (∃𝑔 ∈ 𝑋 𝑧 = [𝑔] ∼ → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))))
147	146	ex 413	. . . . 5 ⊢ (𝜑 → (∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 → (∃𝑔 ∈ 𝑋 𝑧 = [𝑔] ∼ → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))))
148	147	com23 86	. . . 4 ⊢ (𝜑 → (∃𝑔 ∈ 𝑋 𝑧 = [𝑔] ∼ → (∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))))
149	88, 148	biimtrid 243	. . 3 ⊢ (𝜑 → (𝑧 ∈ (𝑋 / ∼ ) → (∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))))
150	149	rexlimdv 3139	. 2 ⊢ (𝜑 → (∃𝑧 ∈ (𝑋 / ∼ )∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))))
151	86, 150	mpd 15	1 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 207 ∧ wa 396 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ≠ wne 2935 ∀wral 3054 ∃wrex 3064 {crab 3392 ⊆ wss 3890 ∅c0 4268 𝒫 cpw 4536 {cpr 4564 class class class wbr 5079 {copab 5141 ↦ cmpt 5160 ran crn 5626 Fn wfn 6487 ‘cfv 6492 (class class class)co 7363 ∈ cmpo 7365 Er wer 8637 [cec 8638 / cqs 8639 Fincfn 8890 0cc0 11036 · cmul 11041 − cmin 11375 / cdiv 11805 ℕcn 12172 ℕ₀cn0 12435 ℤcz 12522 ↑cexp 14021 ♯chash 14290 ∥ cdvds 16219 ℙcprime 16638 pCnt cpc 16805 Basecbs 17177 ↾_s cress 17198 +_gcplusg 17218 0_gc0g 17400 Grpcgrp 18907 inv_gcminusg 18908 -_gcsg 18909 SubGrpcsubg 19094 ~_QG cqg 19096 pGrp cpgp 19499

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 2712 ax-rep 5206 ax-sep 5225 ax-nul 5235 ax-pow 5301 ax-pr 5369 ax-un 7685 ax-inf2 9560 ax-cnex 11092 ax-resscn 11093 ax-1cn 11094 ax-icn 11095 ax-addcl 11096 ax-addrcl 11097 ax-mulcl 11098 ax-mulrcl 11099 ax-mulcom 11100 ax-addass 11101 ax-mulass 11102 ax-distr 11103 ax-i2m1 11104 ax-1ne0 11105 ax-1rid 11106 ax-rnegex 11107 ax-rrecex 11108 ax-cnre 11109 ax-pre-lttri 11110 ax-pre-lttrn 11111 ax-pre-ltadd 11112 ax-pre-mulgt0 11113 ax-pre-sup 11114

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 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-ne 2936 df-nel 3040 df-ral 3055 df-rex 3065 df-rmo 3345 df-reu 3346 df-rab 3393 df-v 3434 df-sbc 3731 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4269 df-if 4462 df-pw 4538 df-sn 4563 df-pr 4565 df-op 4569 df-uni 4846 df-int 4885 df-iun 4930 df-disj 5047 df-br 5080 df-opab 5142 df-mpt 5161 df-tr 5187 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7320 df-ov 7366 df-oprab 7367 df-mpo 7368 df-om 7814 df-1st 7938 df-2nd 7939 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-2o 8403 df-oadd 8406 df-omul 8407 df-er 8640 df-ec 8642 df-qs 8646 df-map 8772 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-sup 9352 df-inf 9353 df-oi 9422 df-dju 9823 df-card 9861 df-acn 9864 df-pnf 11179 df-mnf 11180 df-xr 11181 df-ltxr 11182 df-le 11183 df-sub 11377 df-neg 11378 df-div 11806 df-nn 12173 df-2 12242 df-3 12243 df-n0 12436 df-xnn0 12509 df-z 12523 df-uz 12787 df-q 12897 df-rp 12941 df-fz 13460 df-fzo 13607 df-fl 13749 df-mod 13827 df-seq 13962 df-exp 14022 df-fac 14234 df-bc 14263 df-hash 14291 df-cj 15059 df-re 15060 df-im 15061 df-sqrt 15195 df-abs 15196 df-clim 15448 df-sum 15647 df-dvds 16220 df-gcd 16462 df-prm 16639 df-pc 16806 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17178 df-ress 17199 df-plusg 17231 df-0g 17402 df-mgm 18606 df-sgrp 18685 df-mnd 18701 df-submnd 18750 df-grp 18910 df-minusg 18911 df-sbg 18912 df-mulg 19042 df-subg 19097 df-eqg 19099 df-ga 19263 df-od 19501 df-pgp 19503

This theorem is referenced by: sylow2b 19596

W3C validator