Theorem sylow1lem2 19519

Description: Lemma for sylow1 19523. The function ⊕ is a group action on 𝑆. (Contributed by Mario Carneiro, 15-Jan-2015.)

Hypotheses

Ref	Expression
sylow1.x	⊢ 𝑋 = (Base‘𝐺)
sylow1.g	⊢ (𝜑 → 𝐺 ∈ Grp)
sylow1.f	⊢ (𝜑 → 𝑋 ∈ Fin)
sylow1.p	⊢ (𝜑 → 𝑃 ∈ ℙ)
sylow1.n	⊢ (𝜑 → 𝑁 ∈ ℕ0)
sylow1.d	⊢ (𝜑 → (𝑃↑𝑁) ∥ (♯‘𝑋))
sylow1lem.a	⊢ + = (+g‘𝐺)
sylow1lem.s	⊢ 𝑆 = {𝑠 ∈ 𝒫 𝑋 ∣ (♯‘𝑠) = (𝑃↑𝑁)}
sylow1lem.m	⊢ ⊕ = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑆 ↦ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))

Assertion

Ref	Expression
sylow1lem2	⊢ (𝜑 → ⊕ ∈ (𝐺 GrpAct 𝑆))

Distinct variable groups:   𝑥,𝑠,𝑦,𝑧   𝑥,𝑆,𝑦,𝑧   𝑁,𝑠,𝑥,𝑦,𝑧   𝑋,𝑠,𝑥,𝑦,𝑧   + ,𝑠,𝑥,𝑦,𝑧   𝑥, ⊕ ,𝑦,𝑧   𝐺,𝑠,𝑥,𝑦,𝑧   𝑃,𝑠,𝑥,𝑦,𝑧   𝜑,𝑥,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑠)   ⊕ (𝑠)   𝑆(𝑠)

Proof of Theorem sylow1lem2

Dummy variables 𝑎 𝑏 𝑐 𝑢 𝑤 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		sylow1.g	. . 3 ⊢ (𝜑 → 𝐺 ∈ Grp)
2		sylow1lem.s	. . . 4 ⊢ 𝑆 = {𝑠 ∈ 𝒫 𝑋 ∣ (♯‘𝑠) = (𝑃↑𝑁)}
3		sylow1.x	. . . . . 6 ⊢ 𝑋 = (Base‘𝐺)
4	3	fvexi 6845	. . . . 5 ⊢ 𝑋 ∈ V
5	4	pwex 5322	. . . 4 ⊢ 𝒫 𝑋 ∈ V
6	2, 5	rabex2 5283	. . 3 ⊢ 𝑆 ∈ V
7	1, 6	jctir 520	. 2 ⊢ (𝜑 → (𝐺 ∈ Grp ∧ 𝑆 ∈ V))
8		simprl 770	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → 𝑥 ∈ 𝑋)
9		sylow1lem.a	. . . . . . . . . . . . 13 ⊢ + = (+g‘𝐺)
10		eqid 2733	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧)) = (𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧))
11	3, 9, 10	grplmulf1o 18934	. . . . . . . . . . . 12 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → (𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧)):𝑋–1-1-onto→𝑋)
12	1, 8, 11	syl2an2r 685	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → (𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧)):𝑋–1-1-onto→𝑋)
13		f1of1 6770	. . . . . . . . . . 11 ⊢ ((𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧)):𝑋–1-1-onto→𝑋 → (𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧)):𝑋–1-1→𝑋)
14	12, 13	syl 17	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → (𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧)):𝑋–1-1→𝑋)
15		simprr 772	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → 𝑦 ∈ 𝑆)
16		fveqeq2 6840	. . . . . . . . . . . . . 14 ⊢ (𝑠 = 𝑦 → ((♯‘𝑠) = (𝑃↑𝑁) ↔ (♯‘𝑦) = (𝑃↑𝑁)))
17	16, 2	elrab2 3646	. . . . . . . . . . . . 13 ⊢ (𝑦 ∈ 𝑆 ↔ (𝑦 ∈ 𝒫 𝑋 ∧ (♯‘𝑦) = (𝑃↑𝑁)))
18	15, 17	sylib 218	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → (𝑦 ∈ 𝒫 𝑋 ∧ (♯‘𝑦) = (𝑃↑𝑁)))
19	18	simpld 494	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → 𝑦 ∈ 𝒫 𝑋)
20	19	elpwid 4560	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → 𝑦 ⊆ 𝑋)
21		f1ssres 6734	. . . . . . . . . 10 ⊢ (((𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧)):𝑋–1-1→𝑋 ∧ 𝑦 ⊆ 𝑋) → ((𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧)) ↾ 𝑦):𝑦–1-1→𝑋)
22	14, 20, 21	syl2anc 584	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → ((𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧)) ↾ 𝑦):𝑦–1-1→𝑋)
23		resmpt 5993	. . . . . . . . . 10 ⊢ (𝑦 ⊆ 𝑋 → ((𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧)) ↾ 𝑦) = (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))
24		f1eq1 6722	. . . . . . . . . 10 ⊢ (((𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧)) ↾ 𝑦) = (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) → (((𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧)) ↾ 𝑦):𝑦–1-1→𝑋 ↔ (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)):𝑦–1-1→𝑋))
25	20, 23, 24	3syl 18	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → (((𝑧 ∈ 𝑋 ↦ (𝑥 + 𝑧)) ↾ 𝑦):𝑦–1-1→𝑋 ↔ (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)):𝑦–1-1→𝑋))
26	22, 25	mpbid 232	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)):𝑦–1-1→𝑋)
27		f1f 6727	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)):𝑦–1-1→𝑋 → (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)):𝑦⟶𝑋)
28		frn 6666	. . . . . . . 8 ⊢ ((𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)):𝑦⟶𝑋 → ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ⊆ 𝑋)
29	26, 27, 28	3syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ⊆ 𝑋)
30	4	elpw2 5276	. . . . . . 7 ⊢ (ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ∈ 𝒫 𝑋 ↔ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ⊆ 𝑋)
31	29, 30	sylibr 234	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ∈ 𝒫 𝑋)
32		f1f1orn 6782	. . . . . . . . 9 ⊢ ((𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)):𝑦–1-1→𝑋 → (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)):𝑦–1-1-onto→ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))
33		vex 3441	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
34	33	f1oen 8905	. . . . . . . . 9 ⊢ ((𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)):𝑦–1-1-onto→ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) → 𝑦 ≈ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))
35	26, 32, 34	3syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → 𝑦 ≈ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))
36		sylow1.f	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ∈ Fin)
37		ssfi 9093	. . . . . . . . . 10 ⊢ ((𝑋 ∈ Fin ∧ 𝑦 ⊆ 𝑋) → 𝑦 ∈ Fin)
38	36, 20, 37	syl2an2r 685	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → 𝑦 ∈ Fin)
39		ssfi 9093	. . . . . . . . . 10 ⊢ ((𝑋 ∈ Fin ∧ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ⊆ 𝑋) → ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ∈ Fin)
40	36, 29, 39	syl2an2r 685	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ∈ Fin)
41		hashen 14261	. . . . . . . . 9 ⊢ ((𝑦 ∈ Fin ∧ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ∈ Fin) → ((♯‘𝑦) = (♯‘ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧))) ↔ 𝑦 ≈ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧))))
42	38, 40, 41	syl2anc 584	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → ((♯‘𝑦) = (♯‘ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧))) ↔ 𝑦 ≈ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧))))
43	35, 42	mpbird 257	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → (♯‘𝑦) = (♯‘ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧))))
44	18	simprd 495	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → (♯‘𝑦) = (𝑃↑𝑁))
45	43, 44	eqtr3d 2770	. . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → (♯‘ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧))) = (𝑃↑𝑁))
46		fveqeq2 6840	. . . . . . 7 ⊢ (𝑠 = ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) → ((♯‘𝑠) = (𝑃↑𝑁) ↔ (♯‘ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧))) = (𝑃↑𝑁)))
47	46, 2	elrab2 3646	. . . . . 6 ⊢ (ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ∈ 𝑆 ↔ (ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ∈ 𝒫 𝑋 ∧ (♯‘ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧))) = (𝑃↑𝑁)))
48	31, 45, 47	sylanbrc 583	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑆)) → ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ∈ 𝑆)
49	48	ralrimivva 3176	. . . 4 ⊢ (𝜑 → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ∈ 𝑆)
50		sylow1lem.m	. . . . 5 ⊢ ⊕ = (𝑥 ∈ 𝑋, 𝑦 ∈ 𝑆 ↦ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))
51	50	fmpo 8009	. . . 4 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑆 ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) ∈ 𝑆 ↔ ⊕ :(𝑋 × 𝑆)⟶𝑆)
52	49, 51	sylib 218	. . 3 ⊢ (𝜑 → ⊕ :(𝑋 × 𝑆)⟶𝑆)
53	1	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝐺 ∈ Grp)
54		eqid 2733	. . . . . . . . 9 ⊢ (0g‘𝐺) = (0g‘𝐺)
55	3, 54	grpidcl 18886	. . . . . . . 8 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ 𝑋)
56	53, 55	syl 17	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (0g‘𝐺) ∈ 𝑋)
57		simpr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑎 ∈ 𝑆)
58		simpr 484	. . . . . . . . . 10 ⊢ ((𝑥 = (0g‘𝐺) ∧ 𝑦 = 𝑎) → 𝑦 = 𝑎)
59		simpl 482	. . . . . . . . . . 11 ⊢ ((𝑥 = (0g‘𝐺) ∧ 𝑦 = 𝑎) → 𝑥 = (0g‘𝐺))
60	59	oveq1d 7370	. . . . . . . . . 10 ⊢ ((𝑥 = (0g‘𝐺) ∧ 𝑦 = 𝑎) → (𝑥 + 𝑧) = ((0g‘𝐺) + 𝑧))
61	58, 60	mpteq12dv 5182	. . . . . . . . 9 ⊢ ((𝑥 = (0g‘𝐺) ∧ 𝑦 = 𝑎) → (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) = (𝑧 ∈ 𝑎 ↦ ((0g‘𝐺) + 𝑧)))
62	61	rneqd 5884	. . . . . . . 8 ⊢ ((𝑥 = (0g‘𝐺) ∧ 𝑦 = 𝑎) → ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) = ran (𝑧 ∈ 𝑎 ↦ ((0g‘𝐺) + 𝑧)))
63		vex 3441	. . . . . . . . . 10 ⊢ 𝑎 ∈ V
64	63	mptex 7166	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑎 ↦ ((0g‘𝐺) + 𝑧)) ∈ V
65	64	rnex 7849	. . . . . . . 8 ⊢ ran (𝑧 ∈ 𝑎 ↦ ((0g‘𝐺) + 𝑧)) ∈ V
66	62, 50, 65	ovmpoa 7510	. . . . . . 7 ⊢ (((0g‘𝐺) ∈ 𝑋 ∧ 𝑎 ∈ 𝑆) → ((0g‘𝐺) ⊕ 𝑎) = ran (𝑧 ∈ 𝑎 ↦ ((0g‘𝐺) + 𝑧)))
67	56, 57, 66	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((0g‘𝐺) ⊕ 𝑎) = ran (𝑧 ∈ 𝑎 ↦ ((0g‘𝐺) + 𝑧)))
68	2	ssrab3 4031	. . . . . . . . . . . . . 14 ⊢ 𝑆 ⊆ 𝒫 𝑋
69	68, 57	sselid 3928	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑎 ∈ 𝒫 𝑋)
70	69	elpwid 4560	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → 𝑎 ⊆ 𝑋)
71	70	sselda 3930	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ 𝑧 ∈ 𝑎) → 𝑧 ∈ 𝑋)
72	3, 9, 54	grplid 18888	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ 𝑧 ∈ 𝑋) → ((0g‘𝐺) + 𝑧) = 𝑧)
73	53, 71, 72	syl2an2r 685	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ 𝑧 ∈ 𝑎) → ((0g‘𝐺) + 𝑧) = 𝑧)
74	73	mpteq2dva 5188	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (𝑧 ∈ 𝑎 ↦ ((0g‘𝐺) + 𝑧)) = (𝑧 ∈ 𝑎 ↦ 𝑧))
75		mptresid 6007	. . . . . . . . 9 ⊢ ( I ↾ 𝑎) = (𝑧 ∈ 𝑎 ↦ 𝑧)
76	74, 75	eqtr4di 2786	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (𝑧 ∈ 𝑎 ↦ ((0g‘𝐺) + 𝑧)) = ( I ↾ 𝑎))
77	76	rneqd 5884	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ran (𝑧 ∈ 𝑎 ↦ ((0g‘𝐺) + 𝑧)) = ran ( I ↾ 𝑎))
78		rnresi 6031	. . . . . . 7 ⊢ ran ( I ↾ 𝑎) = 𝑎
79	77, 78	eqtrdi 2784	. . . . . 6 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ran (𝑧 ∈ 𝑎 ↦ ((0g‘𝐺) + 𝑧)) = 𝑎)
80	67, 79	eqtrd 2768	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ((0g‘𝐺) ⊕ 𝑎) = 𝑎)
81		ovex 7388	. . . . . . . . . 10 ⊢ (𝑐 + 𝑧) ∈ V
82		oveq2 7363	. . . . . . . . . 10 ⊢ (𝑤 = (𝑐 + 𝑧) → (𝑏 + 𝑤) = (𝑏 + (𝑐 + 𝑧)))
83	81, 82	abrexco 7187	. . . . . . . . 9 ⊢ {𝑢 ∣ ∃𝑤 ∈ {𝑣 ∣ ∃𝑧 ∈ 𝑎 𝑣 = (𝑐 + 𝑧)}𝑢 = (𝑏 + 𝑤)} = {𝑢 ∣ ∃𝑧 ∈ 𝑎 𝑢 = (𝑏 + (𝑐 + 𝑧))}
84		simprr 772	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → 𝑐 ∈ 𝑋)
85	57	adantr 480	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → 𝑎 ∈ 𝑆)
86		simpr 484	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 = 𝑐 ∧ 𝑦 = 𝑎) → 𝑦 = 𝑎)
87		simpl 482	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑥 = 𝑐 ∧ 𝑦 = 𝑎) → 𝑥 = 𝑐)
88	87	oveq1d 7370	. . . . . . . . . . . . . . . 16 ⊢ ((𝑥 = 𝑐 ∧ 𝑦 = 𝑎) → (𝑥 + 𝑧) = (𝑐 + 𝑧))
89	86, 88	mpteq12dv 5182	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 = 𝑐 ∧ 𝑦 = 𝑎) → (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) = (𝑧 ∈ 𝑎 ↦ (𝑐 + 𝑧)))
90	89	rneqd 5884	. . . . . . . . . . . . . 14 ⊢ ((𝑥 = 𝑐 ∧ 𝑦 = 𝑎) → ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) = ran (𝑧 ∈ 𝑎 ↦ (𝑐 + 𝑧)))
91	63	mptex 7166	. . . . . . . . . . . . . . 15 ⊢ (𝑧 ∈ 𝑎 ↦ (𝑐 + 𝑧)) ∈ V
92	91	rnex 7849	. . . . . . . . . . . . . 14 ⊢ ran (𝑧 ∈ 𝑎 ↦ (𝑐 + 𝑧)) ∈ V
93	90, 50, 92	ovmpoa 7510	. . . . . . . . . . . . 13 ⊢ ((𝑐 ∈ 𝑋 ∧ 𝑎 ∈ 𝑆) → (𝑐 ⊕ 𝑎) = ran (𝑧 ∈ 𝑎 ↦ (𝑐 + 𝑧)))
94	84, 85, 93	syl2anc 584	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → (𝑐 ⊕ 𝑎) = ran (𝑧 ∈ 𝑎 ↦ (𝑐 + 𝑧)))
95		eqid 2733	. . . . . . . . . . . . 13 ⊢ (𝑧 ∈ 𝑎 ↦ (𝑐 + 𝑧)) = (𝑧 ∈ 𝑎 ↦ (𝑐 + 𝑧))
96	95	rnmpt 5903	. . . . . . . . . . . 12 ⊢ ran (𝑧 ∈ 𝑎 ↦ (𝑐 + 𝑧)) = {𝑣 ∣ ∃𝑧 ∈ 𝑎 𝑣 = (𝑐 + 𝑧)}
97	94, 96	eqtrdi 2784	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → (𝑐 ⊕ 𝑎) = {𝑣 ∣ ∃𝑧 ∈ 𝑎 𝑣 = (𝑐 + 𝑧)})
98	97	rexeqdv 3294	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → (∃𝑤 ∈ (𝑐 ⊕ 𝑎)𝑢 = (𝑏 + 𝑤) ↔ ∃𝑤 ∈ {𝑣 ∣ ∃𝑧 ∈ 𝑎 𝑣 = (𝑐 + 𝑧)}𝑢 = (𝑏 + 𝑤)))
99	98	abbidv 2799	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → {𝑢 ∣ ∃𝑤 ∈ (𝑐 ⊕ 𝑎)𝑢 = (𝑏 + 𝑤)} = {𝑢 ∣ ∃𝑤 ∈ {𝑣 ∣ ∃𝑧 ∈ 𝑎 𝑣 = (𝑐 + 𝑧)}𝑢 = (𝑏 + 𝑤)})
100	53	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑎) → 𝐺 ∈ Grp)
101		simprl 770	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → 𝑏 ∈ 𝑋)
102	101	adantr 480	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑎) → 𝑏 ∈ 𝑋)
103	84	adantr 480	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑎) → 𝑐 ∈ 𝑋)
104	71	adantlr 715	. . . . . . . . . . . . 13 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑎) → 𝑧 ∈ 𝑋)
105	3, 9	grpass 18863	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ Grp ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → ((𝑏 + 𝑐) + 𝑧) = (𝑏 + (𝑐 + 𝑧)))
106	100, 102, 103, 104, 105	syl13anc 1374	. . . . . . . . . . . 12 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑎) → ((𝑏 + 𝑐) + 𝑧) = (𝑏 + (𝑐 + 𝑧)))
107	106	eqeq2d 2744	. . . . . . . . . . 11 ⊢ ((((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) ∧ 𝑧 ∈ 𝑎) → (𝑢 = ((𝑏 + 𝑐) + 𝑧) ↔ 𝑢 = (𝑏 + (𝑐 + 𝑧))))
108	107	rexbidva 3155	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → (∃𝑧 ∈ 𝑎 𝑢 = ((𝑏 + 𝑐) + 𝑧) ↔ ∃𝑧 ∈ 𝑎 𝑢 = (𝑏 + (𝑐 + 𝑧))))
109	108	abbidv 2799	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → {𝑢 ∣ ∃𝑧 ∈ 𝑎 𝑢 = ((𝑏 + 𝑐) + 𝑧)} = {𝑢 ∣ ∃𝑧 ∈ 𝑎 𝑢 = (𝑏 + (𝑐 + 𝑧))})
110	83, 99, 109	3eqtr4a 2794	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → {𝑢 ∣ ∃𝑤 ∈ (𝑐 ⊕ 𝑎)𝑢 = (𝑏 + 𝑤)} = {𝑢 ∣ ∃𝑧 ∈ 𝑎 𝑢 = ((𝑏 + 𝑐) + 𝑧)})
111		eqid 2733	. . . . . . . . 9 ⊢ (𝑤 ∈ (𝑐 ⊕ 𝑎) ↦ (𝑏 + 𝑤)) = (𝑤 ∈ (𝑐 ⊕ 𝑎) ↦ (𝑏 + 𝑤))
112	111	rnmpt 5903	. . . . . . . 8 ⊢ ran (𝑤 ∈ (𝑐 ⊕ 𝑎) ↦ (𝑏 + 𝑤)) = {𝑢 ∣ ∃𝑤 ∈ (𝑐 ⊕ 𝑎)𝑢 = (𝑏 + 𝑤)}
113		eqid 2733	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑎 ↦ ((𝑏 + 𝑐) + 𝑧)) = (𝑧 ∈ 𝑎 ↦ ((𝑏 + 𝑐) + 𝑧))
114	113	rnmpt 5903	. . . . . . . 8 ⊢ ran (𝑧 ∈ 𝑎 ↦ ((𝑏 + 𝑐) + 𝑧)) = {𝑢 ∣ ∃𝑧 ∈ 𝑎 𝑢 = ((𝑏 + 𝑐) + 𝑧)}
115	110, 112, 114	3eqtr4g 2793	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → ran (𝑤 ∈ (𝑐 ⊕ 𝑎) ↦ (𝑏 + 𝑤)) = ran (𝑧 ∈ 𝑎 ↦ ((𝑏 + 𝑐) + 𝑧)))
116	52	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → ⊕ :(𝑋 × 𝑆)⟶𝑆)
117	116, 84, 85	fovcdmd 7527	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → (𝑐 ⊕ 𝑎) ∈ 𝑆)
118		simpr 484	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝑏 ∧ 𝑦 = (𝑐 ⊕ 𝑎)) → 𝑦 = (𝑐 ⊕ 𝑎))
119		simpl 482	. . . . . . . . . . . . 13 ⊢ ((𝑥 = 𝑏 ∧ 𝑦 = (𝑐 ⊕ 𝑎)) → 𝑥 = 𝑏)
120	119	oveq1d 7370	. . . . . . . . . . . 12 ⊢ ((𝑥 = 𝑏 ∧ 𝑦 = (𝑐 ⊕ 𝑎)) → (𝑥 + 𝑧) = (𝑏 + 𝑧))
121	118, 120	mpteq12dv 5182	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝑏 ∧ 𝑦 = (𝑐 ⊕ 𝑎)) → (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) = (𝑧 ∈ (𝑐 ⊕ 𝑎) ↦ (𝑏 + 𝑧)))
122		oveq2 7363	. . . . . . . . . . . 12 ⊢ (𝑧 = 𝑤 → (𝑏 + 𝑧) = (𝑏 + 𝑤))
123	122	cbvmptv 5199	. . . . . . . . . . 11 ⊢ (𝑧 ∈ (𝑐 ⊕ 𝑎) ↦ (𝑏 + 𝑧)) = (𝑤 ∈ (𝑐 ⊕ 𝑎) ↦ (𝑏 + 𝑤))
124	121, 123	eqtrdi 2784	. . . . . . . . . 10 ⊢ ((𝑥 = 𝑏 ∧ 𝑦 = (𝑐 ⊕ 𝑎)) → (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) = (𝑤 ∈ (𝑐 ⊕ 𝑎) ↦ (𝑏 + 𝑤)))
125	124	rneqd 5884	. . . . . . . . 9 ⊢ ((𝑥 = 𝑏 ∧ 𝑦 = (𝑐 ⊕ 𝑎)) → ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) = ran (𝑤 ∈ (𝑐 ⊕ 𝑎) ↦ (𝑏 + 𝑤)))
126		ovex 7388	. . . . . . . . . . 11 ⊢ (𝑐 ⊕ 𝑎) ∈ V
127	126	mptex 7166	. . . . . . . . . 10 ⊢ (𝑤 ∈ (𝑐 ⊕ 𝑎) ↦ (𝑏 + 𝑤)) ∈ V
128	127	rnex 7849	. . . . . . . . 9 ⊢ ran (𝑤 ∈ (𝑐 ⊕ 𝑎) ↦ (𝑏 + 𝑤)) ∈ V
129	125, 50, 128	ovmpoa 7510	. . . . . . . 8 ⊢ ((𝑏 ∈ 𝑋 ∧ (𝑐 ⊕ 𝑎) ∈ 𝑆) → (𝑏 ⊕ (𝑐 ⊕ 𝑎)) = ran (𝑤 ∈ (𝑐 ⊕ 𝑎) ↦ (𝑏 + 𝑤)))
130	101, 117, 129	syl2anc 584	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → (𝑏 ⊕ (𝑐 ⊕ 𝑎)) = ran (𝑤 ∈ (𝑐 ⊕ 𝑎) ↦ (𝑏 + 𝑤)))
131	1	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → 𝐺 ∈ Grp)
132	3, 9	grpcl 18862	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋) → (𝑏 + 𝑐) ∈ 𝑋)
133	131, 101, 84, 132	syl3anc 1373	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → (𝑏 + 𝑐) ∈ 𝑋)
134		simpr 484	. . . . . . . . . . 11 ⊢ ((𝑥 = (𝑏 + 𝑐) ∧ 𝑦 = 𝑎) → 𝑦 = 𝑎)
135		simpl 482	. . . . . . . . . . . 12 ⊢ ((𝑥 = (𝑏 + 𝑐) ∧ 𝑦 = 𝑎) → 𝑥 = (𝑏 + 𝑐))
136	135	oveq1d 7370	. . . . . . . . . . 11 ⊢ ((𝑥 = (𝑏 + 𝑐) ∧ 𝑦 = 𝑎) → (𝑥 + 𝑧) = ((𝑏 + 𝑐) + 𝑧))
137	134, 136	mpteq12dv 5182	. . . . . . . . . 10 ⊢ ((𝑥 = (𝑏 + 𝑐) ∧ 𝑦 = 𝑎) → (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) = (𝑧 ∈ 𝑎 ↦ ((𝑏 + 𝑐) + 𝑧)))
138	137	rneqd 5884	. . . . . . . . 9 ⊢ ((𝑥 = (𝑏 + 𝑐) ∧ 𝑦 = 𝑎) → ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) = ran (𝑧 ∈ 𝑎 ↦ ((𝑏 + 𝑐) + 𝑧)))
139	63	mptex 7166	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝑎 ↦ ((𝑏 + 𝑐) + 𝑧)) ∈ V
140	139	rnex 7849	. . . . . . . . 9 ⊢ ran (𝑧 ∈ 𝑎 ↦ ((𝑏 + 𝑐) + 𝑧)) ∈ V
141	138, 50, 140	ovmpoa 7510	. . . . . . . 8 ⊢ (((𝑏 + 𝑐) ∈ 𝑋 ∧ 𝑎 ∈ 𝑆) → ((𝑏 + 𝑐) ⊕ 𝑎) = ran (𝑧 ∈ 𝑎 ↦ ((𝑏 + 𝑐) + 𝑧)))
142	133, 85, 141	syl2anc 584	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → ((𝑏 + 𝑐) ⊕ 𝑎) = ran (𝑧 ∈ 𝑎 ↦ ((𝑏 + 𝑐) + 𝑧)))
143	115, 130, 142	3eqtr4rd 2779	. . . . . 6 ⊢ (((𝜑 ∧ 𝑎 ∈ 𝑆) ∧ (𝑏 ∈ 𝑋 ∧ 𝑐 ∈ 𝑋)) → ((𝑏 + 𝑐) ⊕ 𝑎) = (𝑏 ⊕ (𝑐 ⊕ 𝑎)))
144	143	ralrimivva 3176	. . . . 5 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 ((𝑏 + 𝑐) ⊕ 𝑎) = (𝑏 ⊕ (𝑐 ⊕ 𝑎)))
145	80, 144	jca 511	. . . 4 ⊢ ((𝜑 ∧ 𝑎 ∈ 𝑆) → (((0g‘𝐺) ⊕ 𝑎) = 𝑎 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 ((𝑏 + 𝑐) ⊕ 𝑎) = (𝑏 ⊕ (𝑐 ⊕ 𝑎))))
146	145	ralrimiva 3125	. . 3 ⊢ (𝜑 → ∀𝑎 ∈ 𝑆 (((0g‘𝐺) ⊕ 𝑎) = 𝑎 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 ((𝑏 + 𝑐) ⊕ 𝑎) = (𝑏 ⊕ (𝑐 ⊕ 𝑎))))
147	52, 146	jca 511	. 2 ⊢ (𝜑 → ( ⊕ :(𝑋 × 𝑆)⟶𝑆 ∧ ∀𝑎 ∈ 𝑆 (((0g‘𝐺) ⊕ 𝑎) = 𝑎 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 ((𝑏 + 𝑐) ⊕ 𝑎) = (𝑏 ⊕ (𝑐 ⊕ 𝑎)))))
148	3, 9, 54	isga 19211	. 2 ⊢ ( ⊕ ∈ (𝐺 GrpAct 𝑆) ↔ ((𝐺 ∈ Grp ∧ 𝑆 ∈ V) ∧ ( ⊕ :(𝑋 × 𝑆)⟶𝑆 ∧ ∀𝑎 ∈ 𝑆 (((0g‘𝐺) ⊕ 𝑎) = 𝑎 ∧ ∀𝑏 ∈ 𝑋 ∀𝑐 ∈ 𝑋 ((𝑏 + 𝑐) ⊕ 𝑎) = (𝑏 ⊕ (𝑐 ⊕ 𝑎))))))
149	7, 147, 148	sylanbrc 583	1 ⊢ (𝜑 → ⊕ ∈ (𝐺 GrpAct 𝑆))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1541   ∈ wcel 2113  {cab 2711  ∀wral 3048  ∃wrex 3057  {crab 3396  Vcvv 3437   ⊆ wss 3898  𝒫 cpw 4551   class class class wbr 5095   ↦ cmpt 5176   I cid 5515   × cxp 5619  ran crn 5622   ↾ cres 5623  ⟶wf 6485  –1-1→wf1 6486  –1-1-onto→wf1o 6488  ‘cfv 6489  (class class class)co 7355   ∈ cmpo 7357   ≈ cen 8876  Fincfn 8879  ℕ₀cn0 12392  ↑cexp 13975  ♯chash 14244   ∥ cdvds 16170  ℙcprime 16589  Basecbs 17127  +_gcplusg 17168  0_gc0g 17350  Grpcgrp 18854   GrpAct cga 19209

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677  ax-cnex 11073  ax-resscn 11074  ax-1cn 11075  ax-icn 11076  ax-addcl 11077  ax-addrcl 11078  ax-mulcl 11079  ax-mulrcl 11080  ax-mulcom 11081  ax-addass 11082  ax-mulass 11083  ax-distr 11084  ax-i2m1 11085  ax-1ne0 11086  ax-1rid 11087  ax-rnegex 11088  ax-rrecex 11089  ax-cnre 11090  ax-pre-lttri 11091  ax-pre-lttrn 11092  ax-pre-ltadd 11093  ax-pre-mulgt0 11094

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-nel 3034  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-int 4900  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-riota 7312  df-ov 7358  df-oprab 7359  df-mpo 7360  df-om 7806  df-1st 7930  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338  df-1o 8394  df-er 8631  df-map 8761  df-en 8880  df-dom 8881  df-sdom 8882  df-fin 8883  df-card 9843  df-pnf 11159  df-mnf 11160  df-xr 11161  df-ltxr 11162  df-le 11163  df-sub 11357  df-neg 11358  df-nn 12137  df-n0 12393  df-z 12480  df-uz 12743  df-hash 14245  df-0g 17352  df-mgm 18556  df-sgrp 18635  df-mnd 18651  df-grp 18857  df-minusg 18858  df-ga 19210

This theorem is referenced by:  sylow1lem3  19520  sylow1lem5  19522