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 19561

Description: Sylow's second theorem. Putting together the results of sylow2a 19558 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 19532	. . . . . . . . 9 ⊢ (𝑃 pGrp (𝐺 ↾_s 𝐻) → 𝑃 ∈ ℙ)
3	1, 2	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑃 ∈ ℙ)
4		sylow2b.h	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐻 ∈ (SubGrp‘𝐺))
5		subgrcl 19070	. . . . . . . . . . 11 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
6	4, 5	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐺 ∈ Grp)
7		sylow2b.x	. . . . . . . . . . 11 ⊢ 𝑋 = (Base‘𝐺)
8	7	grpbn0 18908	. . . . . . . . . 10 ⊢ (𝐺 ∈ Grp → 𝑋 ≠ ∅)
9	6, 8	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝑋 ≠ ∅)
10		sylow2b.xf	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ Fin)
11		hashnncl 14343	. . . . . . . . . 10 ⊢ (𝑋 ∈ Fin → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅))
12	10, 11	syl 17	. . . . . . . . 9 ⊢ (𝜑 → ((♯‘𝑋) ∈ ℕ ↔ 𝑋 ≠ ∅))
13	9, 12	mpbird 257	. . . . . . . 8 ⊢ (𝜑 → (♯‘𝑋) ∈ ℕ)
14		pcndvds2 16822	. . . . . . . 8 ⊢ ((𝑃 ∈ ℙ ∧ (♯‘𝑋) ∈ ℕ) → ¬ 𝑃 ∥ ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋)))))
15	3, 13, 14	syl2anc 583	. . . . . . 7 ⊢ (𝜑 → ¬ 𝑃 ∥ ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋)))))
16		sylow2b.r	. . . . . . . . . . 11 ⊢ ∼ = (𝐺 ~_QG 𝐾)
17		sylow2b.k	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐾 ∈ (SubGrp‘𝐺))
18	7, 16, 17, 10	lagsubg2 19133	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝑋) = ((♯‘(𝑋 / ∼ )) · (♯‘𝐾)))
19	18	oveq1d 7429	. . . . . . . . 9 ⊢ (𝜑 → ((♯‘𝑋) / (♯‘𝐾)) = (((♯‘(𝑋 / ∼ )) · (♯‘𝐾)) / (♯‘𝐾)))
20		sylow2blem3.kn	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝐾) = (𝑃↑(𝑃 pCnt (♯‘𝑋))))
21	20	oveq2d 7430	. . . . . . . . 9 ⊢ (𝜑 → ((♯‘𝑋) / (♯‘𝐾)) = ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋)))))
22		pwfi 9192	. . . . . . . . . . . . . 14 ⊢ (𝑋 ∈ Fin ↔ 𝒫 𝑋 ∈ Fin)
23	10, 22	sylib 217	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝒫 𝑋 ∈ Fin)
24	7, 16	eqger 19117	. . . . . . . . . . . . . . 15 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → ∼ Er 𝑋)
25	17, 24	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → ∼ Er 𝑋)
26	25	qsss 8786	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑋 / ∼ ) ⊆ 𝒫 𝑋)
27	23, 26	ssfid 9281	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑋 / ∼ ) ∈ Fin)
28		hashcl 14333	. . . . . . . . . . . 12 ⊢ ((𝑋 / ∼ ) ∈ Fin → (♯‘(𝑋 / ∼ )) ∈ ℕ₀)
29	27, 28	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → (♯‘(𝑋 / ∼ )) ∈ ℕ₀)
30	29	nn0cnd 12550	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘(𝑋 / ∼ )) ∈ ℂ)
31		eqid 2727	. . . . . . . . . . . . . . 15 ⊢ (0_g‘𝐺) = (0_g‘𝐺)
32	31	subg0cl 19073	. . . . . . . . . . . . . 14 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → (0_g‘𝐺) ∈ 𝐾)
33	17, 32	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → (0_g‘𝐺) ∈ 𝐾)
34	33	ne0d 4331	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐾 ≠ ∅)
35	7	subgss 19066	. . . . . . . . . . . . . . 15 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → 𝐾 ⊆ 𝑋)
36	17, 35	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝐾 ⊆ 𝑋)
37	10, 36	ssfid 9281	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐾 ∈ Fin)
38		hashnncl 14343	. . . . . . . . . . . . 13 ⊢ (𝐾 ∈ Fin → ((♯‘𝐾) ∈ ℕ ↔ 𝐾 ≠ ∅))
39	37, 38	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → ((♯‘𝐾) ∈ ℕ ↔ 𝐾 ≠ ∅))
40	34, 39	mpbird 257	. . . . . . . . . . 11 ⊢ (𝜑 → (♯‘𝐾) ∈ ℕ)
41	40	nncnd 12244	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝐾) ∈ ℂ)
42	40	nnne0d 12278	. . . . . . . . . 10 ⊢ (𝜑 → (♯‘𝐾) ≠ 0)
43	30, 41, 42	divcan4d 12012	. . . . . . . . 9 ⊢ (𝜑 → (((♯‘(𝑋 / ∼ )) · (♯‘𝐾)) / (♯‘𝐾)) = (♯‘(𝑋 / ∼ )))
44	19, 21, 43	3eqtr3d 2775	. . . . . . . 8 ⊢ (𝜑 → ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋)))) = (♯‘(𝑋 / ∼ )))
45	44	breq2d 5154	. . . . . . 7 ⊢ (𝜑 → (𝑃 ∥ ((♯‘𝑋) / (𝑃↑(𝑃 pCnt (♯‘𝑋)))) ↔ 𝑃 ∥ (♯‘(𝑋 / ∼ ))))
46	15, 45	mtbid 324	. . . . . 6 ⊢ (𝜑 → ¬ 𝑃 ∥ (♯‘(𝑋 / ∼ )))
47		prmz 16631	. . . . . . . 8 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
48	3, 47	syl 17	. . . . . . 7 ⊢ (𝜑 → 𝑃 ∈ ℤ)
49	29	nn0zd 12600	. . . . . . 7 ⊢ (𝜑 → (♯‘(𝑋 / ∼ )) ∈ ℤ)
50		ssrab2 4073	. . . . . . . . . 10 ⊢ {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ⊆ (𝑋 / ∼ )
51		ssfi 9187	. . . . . . . . . 10 ⊢ (((𝑋 / ∼ ) ∈ Fin ∧ {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ⊆ (𝑋 / ∼ )) → {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ∈ Fin)
52	27, 50, 51	sylancl 585	. . . . . . . . 9 ⊢ (𝜑 → {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ∈ Fin)
53		hashcl 14333	. . . . . . . . 9 ⊢ ({𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ∈ Fin → (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) ∈ ℕ₀)
54	52, 53	syl 17	. . . . . . . 8 ⊢ (𝜑 → (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) ∈ ℕ₀)
55	54	nn0zd 12600	. . . . . . 7 ⊢ (𝜑 → (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) ∈ ℤ)
56		eqid 2727	. . . . . . . 8 ⊢ (Base‘(𝐺 ↾_s 𝐻)) = (Base‘(𝐺 ↾_s 𝐻))
57		sylow2b.a	. . . . . . . . 9 ⊢ + = (+_g‘𝐺)
58		sylow2b.m	. . . . . . . . 9 ⊢ · = (𝑥 ∈ 𝐻, 𝑦 ∈ (𝑋 / ∼ ) ↦ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))
59	7, 10, 4, 17, 57, 16, 58	sylow2blem2 19560	. . . . . . . 8 ⊢ (𝜑 → · ∈ ((𝐺 ↾_s 𝐻) GrpAct (𝑋 / ∼ )))
60		eqid 2727	. . . . . . . . . . 11 ⊢ (𝐺 ↾_s 𝐻) = (𝐺 ↾_s 𝐻)
61	60	subgbas 19069	. . . . . . . . . 10 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 = (Base‘(𝐺 ↾_s 𝐻)))
62	4, 61	syl 17	. . . . . . . . 9 ⊢ (𝜑 → 𝐻 = (Base‘(𝐺 ↾_s 𝐻)))
63	7	subgss 19066	. . . . . . . . . . 11 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋)
64	4, 63	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐻 ⊆ 𝑋)
65	10, 64	ssfid 9281	. . . . . . . . 9 ⊢ (𝜑 → 𝐻 ∈ Fin)
66	62, 65	eqeltrrd 2829	. . . . . . . 8 ⊢ (𝜑 → (Base‘(𝐺 ↾_s 𝐻)) ∈ Fin)
67		eqid 2727	. . . . . . . 8 ⊢ {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} = {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}
68		eqid 2727	. . . . . . . 8 ⊢ {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (𝑋 / ∼ ) ∧ ∃𝑔 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑔 · 𝑥) = 𝑦)} = {⟨𝑥, 𝑦⟩ ∣ ({𝑥, 𝑦} ⊆ (𝑋 / ∼ ) ∧ ∃𝑔 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑔 · 𝑥) = 𝑦)}
69	56, 59, 1, 66, 27, 67, 68	sylow2a 19558	. . . . . . 7 ⊢ (𝜑 → 𝑃 ∥ ((♯‘(𝑋 / ∼ )) − (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧})))
70		dvdssub2 16263	. . . . . . 7 ⊢ (((𝑃 ∈ ℤ ∧ (♯‘(𝑋 / ∼ )) ∈ ℤ ∧ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) ∈ ℤ) ∧ 𝑃 ∥ ((♯‘(𝑋 / ∼ )) − (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}))) → (𝑃 ∥ (♯‘(𝑋 / ∼ )) ↔ 𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧})))
71	48, 49, 55, 69, 70	syl31anc 1371	. . . . . 6 ⊢ (𝜑 → (𝑃 ∥ (♯‘(𝑋 / ∼ )) ↔ 𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧})))
72	46, 71	mtbid 324	. . . . 5 ⊢ (𝜑 → ¬ 𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}))
73		hasheq0 14340	. . . . . . . 8 ⊢ ({𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ∈ Fin → ((♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) = 0 ↔ {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} = ∅))
74	52, 73	syl 17	. . . . . . 7 ⊢ (𝜑 → ((♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) = 0 ↔ {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} = ∅))
75		dvds0 16234	. . . . . . . . 9 ⊢ (𝑃 ∈ ℤ → 𝑃 ∥ 0)
76	48, 75	syl 17	. . . . . . . 8 ⊢ (𝜑 → 𝑃 ∥ 0)
77		breq2 5146	. . . . . . . 8 ⊢ ((♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) = 0 → (𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) ↔ 𝑃 ∥ 0))
78	76, 77	syl5ibrcom 246	. . . . . . 7 ⊢ (𝜑 → ((♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) = 0 → 𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧})))
79	74, 78	sylbird 260	. . . . . 6 ⊢ (𝜑 → ({𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} = ∅ → 𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧})))
80	79	necon3bd 2949	. . . . 5 ⊢ (𝜑 → (¬ 𝑃 ∥ (♯‘{𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧}) → {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ≠ ∅))
81	72, 80	mpd 15	. . . 4 ⊢ (𝜑 → {𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ≠ ∅)
82		rabn0 4381	. . . 4 ⊢ ({𝑧 ∈ (𝑋 / ∼ ) ∣ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧} ≠ ∅ ↔ ∃𝑧 ∈ (𝑋 / ∼ )∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧)
83	81, 82	sylib 217	. . 3 ⊢ (𝜑 → ∃𝑧 ∈ (𝑋 / ∼ )∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧)
84	62	raleqdv 3320	. . . 4 ⊢ (𝜑 → (∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 ↔ ∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧))
85	84	rexbidv 3173	. . 3 ⊢ (𝜑 → (∃𝑧 ∈ (𝑋 / ∼ )∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 ↔ ∃𝑧 ∈ (𝑋 / ∼ )∀𝑢 ∈ (Base‘(𝐺 ↾_s 𝐻))(𝑢 · 𝑧) = 𝑧))
86	83, 85	mpbird 257	. 2 ⊢ (𝜑 → ∃𝑧 ∈ (𝑋 / ∼ )∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧)
87		vex 3473	. . . . 5 ⊢ 𝑧 ∈ V
88	87	elqs 8777	. . . 4 ⊢ (𝑧 ∈ (𝑋 / ∼ ) ↔ ∃𝑔 ∈ 𝑋 𝑧 = [𝑔] ∼ )
89		simplrr 777	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑧 = [𝑔] ∼ )
90	89	oveq2d 7430	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑢 · 𝑧) = (𝑢 · [𝑔] ∼ ))
91		simprr 772	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑢 · 𝑧) = 𝑧)
92		simpll 766	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝜑)
93		simprl 770	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑢 ∈ 𝐻)
94		simplrl 776	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑔 ∈ 𝑋)
95	7, 10, 4, 17, 57, 16, 58	sylow2blem1 19559	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝜑 ∧ 𝑢 ∈ 𝐻 ∧ 𝑔 ∈ 𝑋) → (𝑢 · [𝑔] ∼ ) = [(𝑢 + 𝑔)] ∼ )
96	92, 93, 94, 95	syl3anc 1369	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑢 · [𝑔] ∼ ) = [(𝑢 + 𝑔)] ∼ )
97	90, 91, 96	3eqtr3d 2775	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑧 = [(𝑢 + 𝑔)] ∼ )
98	89, 97	eqtr3d 2769	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → [𝑔] ∼ = [(𝑢 + 𝑔)] ∼ )
99	25	ad2antrr 725	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ∼ Er 𝑋)
100	99, 94	erth 8766	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑔 ∼ (𝑢 + 𝑔) ↔ [𝑔] ∼ = [(𝑢 + 𝑔)] ∼ ))
101	98, 100	mpbird 257	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑔 ∼ (𝑢 + 𝑔))
102	6	ad2antrr 725	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝐺 ∈ Grp)
103	36	ad2antrr 725	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝐾 ⊆ 𝑋)
104		eqid 2727	. . . . . . . . . . . . . . . . . . . 20 ⊢ (inv_g‘𝐺) = (inv_g‘𝐺)
105	7, 104, 57, 16	eqgval 19116	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ Grp ∧ 𝐾 ⊆ 𝑋) → (𝑔 ∼ (𝑢 + 𝑔) ↔ (𝑔 ∈ 𝑋 ∧ (𝑢 + 𝑔) ∈ 𝑋 ∧ (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) ∈ 𝐾)))
106	102, 103, 105	syl2anc 583	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑔 ∼ (𝑢 + 𝑔) ↔ (𝑔 ∈ 𝑋 ∧ (𝑢 + 𝑔) ∈ 𝑋 ∧ (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) ∈ 𝐾)))
107	101, 106	mpbid 231	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑔 ∈ 𝑋 ∧ (𝑢 + 𝑔) ∈ 𝑋 ∧ (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) ∈ 𝐾))
108	107	simp3d 1142	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) ∈ 𝐾)
109		oveq2 7422	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑥 = (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) → (𝑔 + 𝑥) = (𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))))
110	109	oveq1d 7429	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 = (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) → ((𝑔 + 𝑥) − 𝑔) = ((𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) − 𝑔))
111		eqid 2727	. . . . . . . . . . . . . . . . 17 ⊢ (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) = (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))
112		ovex 7447	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) − 𝑔) ∈ V
113	110, 111, 112	fvmpt 6999	. . . . . . . . . . . . . . . 16 ⊢ ((((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) ∈ 𝐾 → ((𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))‘(((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) = ((𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) − 𝑔))
114	108, 113	syl 17	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))‘(((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) = ((𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) − 𝑔))
115	7, 57, 31, 104	grprinv 18932	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ Grp ∧ 𝑔 ∈ 𝑋) → (𝑔 + ((inv_g‘𝐺)‘𝑔)) = (0_g‘𝐺))
116	102, 94, 115	syl2anc 583	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑔 + ((inv_g‘𝐺)‘𝑔)) = (0_g‘𝐺))
117	116	oveq1d 7429	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑔 + ((inv_g‘𝐺)‘𝑔)) + (𝑢 + 𝑔)) = ((0_g‘𝐺) + (𝑢 + 𝑔)))
118	7, 104	grpinvcl 18929	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ Grp ∧ 𝑔 ∈ 𝑋) → ((inv_g‘𝐺)‘𝑔) ∈ 𝑋)
119	102, 94, 118	syl2anc 583	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((inv_g‘𝐺)‘𝑔) ∈ 𝑋)
120	64	ad2antrr 725	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝐻 ⊆ 𝑋)
121	120, 93	sseldd 3979	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑢 ∈ 𝑋)
122	7, 57	grpcl 18883	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ 𝑋 ∧ 𝑔 ∈ 𝑋) → (𝑢 + 𝑔) ∈ 𝑋)
123	102, 121, 94, 122	syl3anc 1369	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑢 + 𝑔) ∈ 𝑋)
124	7, 57	grpass 18884	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺 ∈ Grp ∧ (𝑔 ∈ 𝑋 ∧ ((inv_g‘𝐺)‘𝑔) ∈ 𝑋 ∧ (𝑢 + 𝑔) ∈ 𝑋)) → ((𝑔 + ((inv_g‘𝐺)‘𝑔)) + (𝑢 + 𝑔)) = (𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))))
125	102, 94, 119, 123, 124	syl13anc 1370	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑔 + ((inv_g‘𝐺)‘𝑔)) + (𝑢 + 𝑔)) = (𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))))
126	7, 57, 31	grplid 18909	. . . . . . . . . . . . . . . . . 18 ⊢ ((𝐺 ∈ Grp ∧ (𝑢 + 𝑔) ∈ 𝑋) → ((0_g‘𝐺) + (𝑢 + 𝑔)) = (𝑢 + 𝑔))
127	102, 123, 126	syl2anc 583	. . . . . . . . . . . . . . . . 17 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((0_g‘𝐺) + (𝑢 + 𝑔)) = (𝑢 + 𝑔))
128	117, 125, 127	3eqtr3d 2775	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → (𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) = (𝑢 + 𝑔))
129	128	oveq1d 7429	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑔 + (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) − 𝑔) = ((𝑢 + 𝑔) − 𝑔))
130		sylow2blem3.d	. . . . . . . . . . . . . . . . 17 ⊢ − = (-_g‘𝐺)
131	7, 57, 130	grppncan 18971	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺 ∈ Grp ∧ 𝑢 ∈ 𝑋 ∧ 𝑔 ∈ 𝑋) → ((𝑢 + 𝑔) − 𝑔) = 𝑢)
132	102, 121, 94, 131	syl3anc 1369	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑢 + 𝑔) − 𝑔) = 𝑢)
133	114, 129, 132	3eqtrd 2771	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))‘(((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) = 𝑢)
134		ovex 7447	. . . . . . . . . . . . . . . 16 ⊢ ((𝑔 + 𝑥) − 𝑔) ∈ V
135	134, 111	fnmpti 6692	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) Fn 𝐾
136		fnfvelrn 7084	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) Fn 𝐾 ∧ (((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔)) ∈ 𝐾) → ((𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))‘(((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
137	135, 108, 136	sylancr 586	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → ((𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))‘(((inv_g‘𝐺)‘𝑔) + (𝑢 + 𝑔))) ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
138	133, 137	eqeltrrd 2829	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ (𝑢 ∈ 𝐻 ∧ (𝑢 · 𝑧) = 𝑧)) → 𝑢 ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
139	138	expr 456	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ 𝑢 ∈ 𝐻) → ((𝑢 · 𝑧) = 𝑧 → 𝑢 ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))))
140	139	ralimdva 3162	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) → (∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 → ∀𝑢 ∈ 𝐻 𝑢 ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))))
141	140	imp 406	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) ∧ ∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧) → ∀𝑢 ∈ 𝐻 𝑢 ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
142	141	an32s 651	. . . . . . . . 9 ⊢ (((𝜑 ∧ ∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧) ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) → ∀𝑢 ∈ 𝐻 𝑢 ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
143		dfss3 3966	. . . . . . . . 9 ⊢ (𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)) ↔ ∀𝑢 ∈ 𝐻 𝑢 ∈ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
144	142, 143	sylibr 233	. . . . . . . 8 ⊢ (((𝜑 ∧ ∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧) ∧ (𝑔 ∈ 𝑋 ∧ 𝑧 = [𝑔] ∼ )) → 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))
145	144	expr 456	. . . . . . 7 ⊢ (((𝜑 ∧ ∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧) ∧ 𝑔 ∈ 𝑋) → (𝑧 = [𝑔] ∼ → 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))))
146	145	reximdva 3163	. . . . . 6 ⊢ ((𝜑 ∧ ∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧) → (∃𝑔 ∈ 𝑋 𝑧 = [𝑔] ∼ → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))))
147	146	ex 412	. . . . 5 ⊢ (𝜑 → (∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 → (∃𝑔 ∈ 𝑋 𝑧 = [𝑔] ∼ → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))))
148	147	com23 86	. . . 4 ⊢ (𝜑 → (∃𝑔 ∈ 𝑋 𝑧 = [𝑔] ∼ → (∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))))
149	88, 148	biimtrid 241	. . 3 ⊢ (𝜑 → (𝑧 ∈ (𝑋 / ∼ ) → (∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))))
150	149	rexlimdv 3148	. 2 ⊢ (𝜑 → (∃𝑧 ∈ (𝑋 / ∼ )∀𝑢 ∈ 𝐻 (𝑢 · 𝑧) = 𝑧 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔))))
151	86, 150	mpd 15	1 ⊢ (𝜑 → ∃𝑔 ∈ 𝑋 𝐻 ⊆ ran (𝑥 ∈ 𝐾 ↦ ((𝑔 + 𝑥) − 𝑔)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1534 ∈ wcel 2099 ≠ wne 2935 ∀wral 3056 ∃wrex 3065 {crab 3427 ⊆ wss 3944 ∅c0 4318 𝒫 cpw 4598 {cpr 4626 class class class wbr 5142 {copab 5204 ↦ cmpt 5225 ran crn 5673 Fn wfn 6537 ‘cfv 6542 (class class class)co 7414 ∈ cmpo 7416 Er wer 8713 [cec 8714 / cqs 8715 Fincfn 8953 0cc0 11124 · cmul 11129 − cmin 11460 / cdiv 11887 ℕcn 12228 ℕ₀cn0 12488 ℤcz 12574 ↑cexp 14044 ♯chash 14307 ∥ cdvds 16216 ℙcprime 16627 pCnt cpc 16790 Basecbs 17165 ↾_s cress 17194 +_gcplusg 17218 0_gc0g 17406 Grpcgrp 18875 inv_gcminusg 18876 -_gcsg 18877 SubGrpcsubg 19059 ~_QG cqg 19061 pGrp cpgp 19465

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7732 ax-inf2 9650 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-int 4945 df-iun 4993 df-disj 5108 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-se 5628 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-isom 6551 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7863 df-1st 7985 df-2nd 7986 df-frecs 8278 df-wrecs 8309 df-recs 8383 df-rdg 8422 df-1o 8478 df-2o 8479 df-oadd 8482 df-omul 8483 df-er 8716 df-ec 8718 df-qs 8722 df-map 8836 df-en 8954 df-dom 8955 df-sdom 8956 df-fin 8957 df-sup 9451 df-inf 9452 df-oi 9519 df-dju 9910 df-card 9948 df-acn 9951 df-pnf 11266 df-mnf 11267 df-xr 11268 df-ltxr 11269 df-le 11270 df-sub 11462 df-neg 11463 df-div 11888 df-nn 12229 df-2 12291 df-3 12292 df-n0 12489 df-xnn0 12561 df-z 12575 df-uz 12839 df-q 12949 df-rp 12993 df-fz 13503 df-fzo 13646 df-fl 13775 df-mod 13853 df-seq 13985 df-exp 14045 df-fac 14251 df-bc 14280 df-hash 14308 df-cj 15064 df-re 15065 df-im 15066 df-sqrt 15200 df-abs 15201 df-clim 15450 df-sum 15651 df-dvds 16217 df-gcd 16455 df-prm 16628 df-pc 16791 df-sets 17118 df-slot 17136 df-ndx 17148 df-base 17166 df-ress 17195 df-plusg 17231 df-0g 17408 df-mgm 18585 df-sgrp 18664 df-mnd 18680 df-submnd 18726 df-grp 18878 df-minusg 18879 df-sbg 18880 df-mulg 19008 df-subg 19062 df-eqg 19064 df-ga 19225 df-od 19467 df-pgp 19469

This theorem is referenced by: sylow2b 19562

W3C validator