Theorem sylow2blem1 19885

Description: Lemma for sylow2b 19888. Evaluate the group action on a left coset. (Contributed by Mario Carneiro, 17-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 (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))

Assertion

Ref	Expression
sylow2blem1	⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝐵 · [𝐶] ∼ ) = [(𝐵 + 𝐶)] ∼ )

Distinct variable groups:   𝑥,𝑦,𝑧,𝐺   𝑥,𝐾,𝑦,𝑧   𝑥, · ,𝑦,𝑧   𝑥, + ,𝑦,𝑧   𝑥, ∼ ,𝑦,𝑧   𝜑,𝑧   𝑥,𝐵,𝑦,𝑧   𝑥,𝐶,𝑦,𝑧   𝑥,𝐻,𝑦,𝑧   𝑥,𝑋,𝑦,𝑧

Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem sylow2blem1

Step	Hyp	Ref	Expression
1		simp2 1155	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐵 ∈ 𝐻)
2		sylow2b.r	. . . . 5 ⊢ ∼ = (𝐺 ~QG 𝐾)
3	2	ovexi 7485	. . . 4 ⊢ ∼ ∈ V
4		simp3 1156	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐶 ∈ 𝑋)
5		ecelqsw 8827	. . . 4 ⊢ (( ∼ ∈ V ∧ 𝐶 ∈ 𝑋) → [𝐶] ∼ ∈ (𝑋 / ∼ ))
6	3, 4, 5	sylancr 599	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → [𝐶] ∼ ∈ (𝑋 / ∼ ))
7		simpr 490	. . . . . 6 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = [𝐶] ∼ ) → 𝑦 = [𝐶] ∼ )
8		simpl 488	. . . . . . 7 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = [𝐶] ∼ ) → 𝑥 = 𝐵)
9	8	oveq1d 7466	. . . . . 6 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = [𝐶] ∼ ) → (𝑥 + 𝑧) = (𝐵 + 𝑧))
10	7, 9	mpteq12dv 5198	. . . . 5 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = [𝐶] ∼ ) → (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) = (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
11	10	rneqd 5932	. . . 4 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = [𝐶] ∼ ) → ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) = ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
12		sylow2b.m	. . . 4 ⊢ · = (𝑥 ∈ 𝐻, 𝑦 ∈ (𝑋 / ∼ ) ↦ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))
13		ecexg 8759	. . . . . . 7 ⊢ ( ∼ ∈ V → [𝐶] ∼ ∈ V)
14	3, 13	ax-mp 5	. . . . . 6 ⊢ [𝐶] ∼ ∈ V
15	14	mptex 7260	. . . . 5 ⊢ (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ∈ V
16	15	rnex 7956	. . . 4 ⊢ ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ∈ V
17	11, 12, 16	ovmpoa 7607	. . 3 ⊢ ((𝐵 ∈ 𝐻 ∧ [𝐶] ∼ ∈ (𝑋 / ∼ )) → (𝐵 · [𝐶] ∼ ) = ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
18	1, 6, 17	syl2anc 596	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝐵 · [𝐶] ∼ ) = ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
19		sylow2b.xf	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ Fin)
20		sylow2b.k	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ (SubGrp‘𝐺))
21		sylow2b.x	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
22	21, 2	eqger 19440	. . . . . . 7 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → ∼ Er 𝑋)
23	20, 22	syl 18	. . . . . 6 ⊢ (𝜑 → ∼ Er 𝑋)
24	23	ecss 8807	. . . . 5 ⊢ (𝜑 → [(𝐵 + 𝐶)] ∼ ⊆ 𝑋)
25	19, 24	ssfid 9298	. . . 4 ⊢ (𝜑 → [(𝐵 + 𝐶)] ∼ ∈ Fin)
26	25	3ad2ant1 1151	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → [(𝐵 + 𝐶)] ∼ ∈ Fin)
27		vex 3458	. . . . . . . 8 ⊢ 𝑧 ∈ V
28		elecg 8800	. . . . . . . 8 ⊢ ((𝑧 ∈ V ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ [𝐶] ∼ ↔ 𝐶 ∼ 𝑧))
29	27, 4, 28	sylancr 599	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ [𝐶] ∼ ↔ 𝐶 ∼ 𝑧))
30	29	biimpa 482	. . . . . 6 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝑧 ∈ [𝐶] ∼ ) → 𝐶 ∼ 𝑧)
31		sylow2b.h	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐻 ∈ (SubGrp‘𝐺))
32		subgrcl 19391	. . . . . . . . . . . 12 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
33	31, 32	syl 18	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 ∈ Grp)
34	33	3ad2ant1 1151	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐺 ∈ Grp)
35	21	subgss 19387	. . . . . . . . . . . . 13 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋)
36	31, 35	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐻 ⊆ 𝑋)
37	36	3ad2ant1 1151	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐻 ⊆ 𝑋)
38	37, 1	sseldd 3914	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐵 ∈ 𝑋)
39		sylow2b.a	. . . . . . . . . . 11 ⊢ + = (+g‘𝐺)
40	21, 39	grpcl 19202	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵 + 𝐶) ∈ 𝑋)
41	34, 38, 4, 40	syl3anc 1399	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝐵 + 𝐶) ∈ 𝑋)
42	41	adantr 486	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (𝐵 + 𝐶) ∈ 𝑋)
43	34	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → 𝐺 ∈ Grp)
44	38	adantr 486	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → 𝐵 ∈ 𝑋)
45	21	subgss 19387	. . . . . . . . . . . . . 14 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → 𝐾 ⊆ 𝑋)
46	20, 45	syl 18	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐾 ⊆ 𝑋)
47		eqid 2763	. . . . . . . . . . . . . 14 ⊢ (invg‘𝐺) = (invg‘𝐺)
48	21, 47, 39, 2	eqgval 19439	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ Grp ∧ 𝐾 ⊆ 𝑋) → (𝐶 ∼ 𝑧 ↔ (𝐶 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐶) + 𝑧) ∈ 𝐾)))
49	33, 46, 48	syl2anc 596	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 ∼ 𝑧 ↔ (𝐶 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐶) + 𝑧) ∈ 𝐾)))
50	49	3ad2ant1 1151	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝐶 ∼ 𝑧 ↔ (𝐶 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐶) + 𝑧) ∈ 𝐾)))
51	50	biimpa 482	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (𝐶 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝐶) + 𝑧) ∈ 𝐾))
52	51	simp2d 1161	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → 𝑧 ∈ 𝑋)
53	21, 39	grpcl 19202	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝐵 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → (𝐵 + 𝑧) ∈ 𝑋)
54	43, 44, 52, 53	syl3anc 1399	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (𝐵 + 𝑧) ∈ 𝑋)
55	21, 47	grpinvcl 19248	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ Grp ∧ (𝐵 + 𝐶) ∈ 𝑋) → ((invg‘𝐺)‘(𝐵 + 𝐶)) ∈ 𝑋)
56	34, 41, 55	syl2anc 596	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((invg‘𝐺)‘(𝐵 + 𝐶)) ∈ 𝑋)
57	56	adantr 486	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → ((invg‘𝐺)‘(𝐵 + 𝐶)) ∈ 𝑋)
58	21, 39	grpass 19203	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ (((invg‘𝐺)‘(𝐵 + 𝐶)) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → ((((invg‘𝐺)‘(𝐵 + 𝐶)) + 𝐵) + 𝑧) = (((invg‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)))
59	43, 57, 44, 52, 58	syl13anc 1400	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → ((((invg‘𝐺)‘(𝐵 + 𝐶)) + 𝐵) + 𝑧) = (((invg‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)))
60	21, 39, 47	grpinvadd 19278	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺 ∈ Grp ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → ((invg‘𝐺)‘(𝐵 + 𝐶)) = (((invg‘𝐺)‘𝐶) + ((invg‘𝐺)‘𝐵)))
61	34, 38, 4, 60	syl3anc 1399	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((invg‘𝐺)‘(𝐵 + 𝐶)) = (((invg‘𝐺)‘𝐶) + ((invg‘𝐺)‘𝐵)))
62	21, 47	grpinvcl 19248	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐺 ∈ Grp ∧ 𝐶 ∈ 𝑋) → ((invg‘𝐺)‘𝐶) ∈ 𝑋)
63	34, 4, 62	syl2anc 596	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((invg‘𝐺)‘𝐶) ∈ 𝑋)
64		eqid 2763	. . . . . . . . . . . . . . . . 17 ⊢ (-g‘𝐺) = (-g‘𝐺)
65	21, 39, 47, 64	grpsubval 19246	. . . . . . . . . . . . . . . 16 ⊢ ((((invg‘𝐺)‘𝐶) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((invg‘𝐺)‘𝐶)(-g‘𝐺)𝐵) = (((invg‘𝐺)‘𝐶) + ((invg‘𝐺)‘𝐵)))
66	63, 38, 65	syl2anc 596	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (((invg‘𝐺)‘𝐶)(-g‘𝐺)𝐵) = (((invg‘𝐺)‘𝐶) + ((invg‘𝐺)‘𝐵)))
67	61, 66	eqtr4d 2801	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((invg‘𝐺)‘(𝐵 + 𝐶)) = (((invg‘𝐺)‘𝐶)(-g‘𝐺)𝐵))
68	67	oveq1d 7466	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (((invg‘𝐺)‘(𝐵 + 𝐶)) + 𝐵) = ((((invg‘𝐺)‘𝐶)(-g‘𝐺)𝐵) + 𝐵))
69	21, 39, 64	grpnpcan 19292	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ Grp ∧ ((invg‘𝐺)‘𝐶) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((((invg‘𝐺)‘𝐶)(-g‘𝐺)𝐵) + 𝐵) = ((invg‘𝐺)‘𝐶))
70	34, 63, 38, 69	syl3anc 1399	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((((invg‘𝐺)‘𝐶)(-g‘𝐺)𝐵) + 𝐵) = ((invg‘𝐺)‘𝐶))
71	68, 70	eqtrd 2798	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (((invg‘𝐺)‘(𝐵 + 𝐶)) + 𝐵) = ((invg‘𝐺)‘𝐶))
72	71	oveq1d 7466	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((((invg‘𝐺)‘(𝐵 + 𝐶)) + 𝐵) + 𝑧) = (((invg‘𝐺)‘𝐶) + 𝑧))
73	72	adantr 486	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → ((((invg‘𝐺)‘(𝐵 + 𝐶)) + 𝐵) + 𝑧) = (((invg‘𝐺)‘𝐶) + 𝑧))
74	59, 73	eqtr3d 2800	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (((invg‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)) = (((invg‘𝐺)‘𝐶) + 𝑧))
75	51	simp3d 1162	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (((invg‘𝐺)‘𝐶) + 𝑧) ∈ 𝐾)
76	74, 75	eqeltrd 2864	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (((invg‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)) ∈ 𝐾)
77	21, 47, 39, 2	eqgval 19439	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ 𝐾 ⊆ 𝑋) → ((𝐵 + 𝐶) ∼ (𝐵 + 𝑧) ↔ ((𝐵 + 𝐶) ∈ 𝑋 ∧ (𝐵 + 𝑧) ∈ 𝑋 ∧ (((invg‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)) ∈ 𝐾)))
78	33, 46, 77	syl2anc 596	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐵 + 𝐶) ∼ (𝐵 + 𝑧) ↔ ((𝐵 + 𝐶) ∈ 𝑋 ∧ (𝐵 + 𝑧) ∈ 𝑋 ∧ (((invg‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)) ∈ 𝐾)))
79	78	3ad2ant1 1151	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((𝐵 + 𝐶) ∼ (𝐵 + 𝑧) ↔ ((𝐵 + 𝐶) ∈ 𝑋 ∧ (𝐵 + 𝑧) ∈ 𝑋 ∧ (((invg‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)) ∈ 𝐾)))
80	79	adantr 486	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → ((𝐵 + 𝐶) ∼ (𝐵 + 𝑧) ↔ ((𝐵 + 𝐶) ∈ 𝑋 ∧ (𝐵 + 𝑧) ∈ 𝑋 ∧ (((invg‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)) ∈ 𝐾)))
81	42, 54, 76, 80	mpbir3and 1361	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (𝐵 + 𝐶) ∼ (𝐵 + 𝑧))
82		ovex 7484	. . . . . . . 8 ⊢ (𝐵 + 𝑧) ∈ V
83		ovex 7484	. . . . . . . 8 ⊢ (𝐵 + 𝐶) ∈ V
84	82, 83	elec 8802	. . . . . . 7 ⊢ ((𝐵 + 𝑧) ∈ [(𝐵 + 𝐶)] ∼ ↔ (𝐵 + 𝐶) ∼ (𝐵 + 𝑧))
85	81, 84	sylibr 237	. . . . . 6 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (𝐵 + 𝑧) ∈ [(𝐵 + 𝐶)] ∼ )
86	30, 85	syldan 603	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝑧 ∈ [𝐶] ∼ ) → (𝐵 + 𝑧) ∈ [(𝐵 + 𝐶)] ∼ )
87	86	fmpttd 7147	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ ⟶[(𝐵 + 𝐶)] ∼ )
88	87	frnd 6748	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ⊆ [(𝐵 + 𝐶)] ∼ )
89		eqid 2763	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) = (𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧))
90	21, 39, 89	grplmulf1o 19273	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝐵 ∈ 𝑋) → (𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)):𝑋⟶1-1onto𝑋)
91	34, 38, 90	syl2anc 596	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)):𝑋⟶1-1onto𝑋)
92		f1of1 6853	. . . . . . . . 9 ⊢ ((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)):𝑋⟶1-1onto𝑋 → (𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)):𝑋⟶1-1𝑋)
93	91, 92	syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)):𝑋⟶1-1𝑋)
94	23	ecss 8807	. . . . . . . . 9 ⊢ (𝜑 → [𝐶] ∼ ⊆ 𝑋)
95	94	3ad2ant1 1151	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → [𝐶] ∼ ⊆ 𝑋)
96		f1ssres 6817	. . . . . . . 8 ⊢ (((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)):𝑋⟶1-1𝑋 ∧ [𝐶] ∼ ⊆ 𝑋) → ((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) ↾ [𝐶] ∼ ):[𝐶] ∼ ⟶1-1𝑋)
97	93, 95, 96	syl2anc 596	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) ↾ [𝐶] ∼ ):[𝐶] ∼ ⟶1-1𝑋)
98		resmpt 6047	. . . . . . . 8 ⊢ ([𝐶] ∼ ⊆ 𝑋 → ((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) ↾ [𝐶] ∼ ) = (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
99		f1eq1 6803	. . . . . . . 8 ⊢ (((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) ↾ [𝐶] ∼ ) = (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) → (((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) ↾ [𝐶] ∼ ):[𝐶] ∼ ⟶1-1𝑋 ↔ (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ ⟶1-1𝑋))
100	95, 98, 99	3syl 19	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) ↾ [𝐶] ∼ ):[𝐶] ∼ ⟶1-1𝑋 ↔ (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ ⟶1-1𝑋))
101	97, 100	mpbid 235	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ ⟶1-1𝑋)
102		f1f1orn 6866	. . . . . 6 ⊢ ((𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ ⟶1-1𝑋 → (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ ⟶1-1ontoran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
103	101, 102	syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ ⟶1-1ontoran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
104	14	f1oen 9037	. . . . 5 ⊢ ((𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ ⟶1-1ontoran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) → [𝐶] ∼ ≈ ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
105		ensym 9068	. . . . 5 ⊢ ([𝐶] ∼ ≈ ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ≈ [𝐶] ∼ )
106	103, 104, 105	3syl 19	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ≈ [𝐶] ∼ )
107	20	3ad2ant1 1151	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐾 ∈ (SubGrp‘𝐺))
108	21, 2	eqgen 19443	. . . . . . 7 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ [𝐶] ∼ ∈ (𝑋 / ∼ )) → 𝐾 ≈ [𝐶] ∼ )
109	107, 6, 108	syl2anc 596	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐾 ≈ [𝐶] ∼ )
110		ensym 9068	. . . . . 6 ⊢ (𝐾 ≈ [𝐶] ∼ → [𝐶] ∼ ≈ 𝐾)
111	109, 110	syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → [𝐶] ∼ ≈ 𝐾)
112		ecelqsw 8827	. . . . . . 7 ⊢ (( ∼ ∈ V ∧ (𝐵 + 𝐶) ∈ 𝑋) → [(𝐵 + 𝐶)] ∼ ∈ (𝑋 / ∼ ))
113	3, 41, 112	sylancr 599	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → [(𝐵 + 𝐶)] ∼ ∈ (𝑋 / ∼ ))
114	21, 2	eqgen 19443	. . . . . 6 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ [(𝐵 + 𝐶)] ∼ ∈ (𝑋 / ∼ )) → 𝐾 ≈ [(𝐵 + 𝐶)] ∼ )
115	107, 113, 114	syl2anc 596	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐾 ≈ [(𝐵 + 𝐶)] ∼ )
116		entr 9071	. . . . 5 ⊢ (([𝐶] ∼ ≈ 𝐾 ∧ 𝐾 ≈ [(𝐵 + 𝐶)] ∼ ) → [𝐶] ∼ ≈ [(𝐵 + 𝐶)] ∼ )
117	111, 115, 116	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → [𝐶] ∼ ≈ [(𝐵 + 𝐶)] ∼ )
118		entr 9071	. . . 4 ⊢ ((ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ≈ [𝐶] ∼ ∧ [𝐶] ∼ ≈ [(𝐵 + 𝐶)] ∼ ) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ≈ [(𝐵 + 𝐶)] ∼ )
119	106, 117, 118	syl2anc 596	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ≈ [(𝐵 + 𝐶)] ∼ )
120		fisseneq 9292	. . 3 ⊢ (([(𝐵 + 𝐶)] ∼ ∈ Fin ∧ ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ⊆ [(𝐵 + 𝐶)] ∼ ∧ ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ≈ [(𝐵 + 𝐶)] ∼ ) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) = [(𝐵 + 𝐶)] ∼ )
121	26, 88, 119, 120	syl3anc 1399	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) = [(𝐵 + 𝐶)] ∼ )
122	18, 121	eqtrd 2798	1 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝐵 · [𝐶] ∼ ) = [(𝐵 + 𝐶)] ∼ )

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   class class class wbr 5108   ↦ cmpt 5192  ran crn 5659   ↾ cres 5660  ⟶1-1wf1 6563  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453   Er wer 8752  [cec 8753   / cqs 8754   ≈ cen 9008  Fincfn 9011  Basecbs 17431  +_gcplusg 17472  Grpcgrp 19194  inv_gcminusg 19195  -_gcsg 19196  SubGrpcsubg 19380   ~_QG cqg 19382

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-er 8755  df-ec 8757  df-qs 8761  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-sets 17386  df-slot 17404  df-ndx 17416  df-base 17432  df-ress 17453  df-plusg 17486  df-0g 17662  df-mgm 18866  df-sgrp 18958  df-mnd 18974  df-grp 19197  df-minusg 19198  df-sbg 19199  df-subg 19383  df-eqg 19385

This theorem is used by:  sylow2blem2  19886  sylow2blem3  19887