sylow2blem1 - Metamath Proof Explorer

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

Theorem sylow2blem1 19490

Description: Lemma for sylow2b 19493. 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 1137	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐵 ∈ 𝐻)
2		sylow2b.r	. . . . 5 ⊢ ∼ = (𝐺 ~_QG 𝐾)
3	2	ovexi 7445	. . . 4 ⊢ ∼ ∈ V
4		simp3 1138	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐶 ∈ 𝑋)
5		ecelqsg 8768	. . . 4 ⊢ (( ∼ ∈ V ∧ 𝐶 ∈ 𝑋) → [𝐶] ∼ ∈ (𝑋 / ∼ ))
6	3, 4, 5	sylancr 587	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → [𝐶] ∼ ∈ (𝑋 / ∼ ))
7		simpr 485	. . . . . 6 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = [𝐶] ∼ ) → 𝑦 = [𝐶] ∼ )
8		simpl 483	. . . . . . 7 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = [𝐶] ∼ ) → 𝑥 = 𝐵)
9	8	oveq1d 7426	. . . . . 6 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = [𝐶] ∼ ) → (𝑥 + 𝑧) = (𝐵 + 𝑧))
10	7, 9	mpteq12dv 5239	. . . . 5 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = [𝐶] ∼ ) → (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) = (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
11	10	rneqd 5937	. . . 4 ⊢ ((𝑥 = 𝐵 ∧ 𝑦 = [𝐶] ∼ ) → ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)) = ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
12		sylow2b.m	. . . 4 ⊢ · = (𝑥 ∈ 𝐻, 𝑦 ∈ (𝑋 / ∼ ) ↦ ran (𝑧 ∈ 𝑦 ↦ (𝑥 + 𝑧)))
13		ecexg 8709	. . . . . . 7 ⊢ ( ∼ ∈ V → [𝐶] ∼ ∈ V)
14	3, 13	ax-mp 5	. . . . . 6 ⊢ [𝐶] ∼ ∈ V
15	14	mptex 7227	. . . . 5 ⊢ (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ∈ V
16	15	rnex 7905	. . . 4 ⊢ ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ∈ V
17	11, 12, 16	ovmpoa 7565	. . 3 ⊢ ((𝐵 ∈ 𝐻 ∧ [𝐶] ∼ ∈ (𝑋 / ∼ )) → (𝐵 · [𝐶] ∼ ) = ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
18	1, 6, 17	syl2anc 584	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝐵 · [𝐶] ∼ ) = ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
19		sylow2b.xf	. . . . 5 ⊢ (𝜑 → 𝑋 ∈ Fin)
20		sylow2b.k	. . . . . . 7 ⊢ (𝜑 → 𝐾 ∈ (SubGrp‘𝐺))
21		sylow2b.x	. . . . . . . 8 ⊢ 𝑋 = (Base‘𝐺)
22	21, 2	eqger 19060	. . . . . . 7 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → ∼ Er 𝑋)
23	20, 22	syl 17	. . . . . 6 ⊢ (𝜑 → ∼ Er 𝑋)
24	23	ecss 8751	. . . . 5 ⊢ (𝜑 → [(𝐵 + 𝐶)] ∼ ⊆ 𝑋)
25	19, 24	ssfid 9269	. . . 4 ⊢ (𝜑 → [(𝐵 + 𝐶)] ∼ ∈ Fin)
26	25	3ad2ant1 1133	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → [(𝐵 + 𝐶)] ∼ ∈ Fin)
27		vex 3478	. . . . . . . 8 ⊢ 𝑧 ∈ V
28		elecg 8748	. . . . . . . 8 ⊢ ((𝑧 ∈ V ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ [𝐶] ∼ ↔ 𝐶 ∼ 𝑧))
29	27, 4, 28	sylancr 587	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ [𝐶] ∼ ↔ 𝐶 ∼ 𝑧))
30	29	biimpa 477	. . . . . 6 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝑧 ∈ [𝐶] ∼ ) → 𝐶 ∼ 𝑧)
31		sylow2b.h	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐻 ∈ (SubGrp‘𝐺))
32		subgrcl 19013	. . . . . . . . . . . 12 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
33	31, 32	syl 17	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐺 ∈ Grp)
34	33	3ad2ant1 1133	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐺 ∈ Grp)
35	21	subgss 19009	. . . . . . . . . . . . 13 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → 𝐻 ⊆ 𝑋)
36	31, 35	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐻 ⊆ 𝑋)
37	36	3ad2ant1 1133	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐻 ⊆ 𝑋)
38	37, 1	sseldd 3983	. . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐵 ∈ 𝑋)
39		sylow2b.a	. . . . . . . . . . 11 ⊢ + = (+_g‘𝐺)
40	21, 39	grpcl 18829	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵 + 𝐶) ∈ 𝑋)
41	34, 38, 4, 40	syl3anc 1371	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝐵 + 𝐶) ∈ 𝑋)
42	41	adantr 481	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (𝐵 + 𝐶) ∈ 𝑋)
43	34	adantr 481	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → 𝐺 ∈ Grp)
44	38	adantr 481	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → 𝐵 ∈ 𝑋)
45	21	subgss 19009	. . . . . . . . . . . . . 14 ⊢ (𝐾 ∈ (SubGrp‘𝐺) → 𝐾 ⊆ 𝑋)
46	20, 45	syl 17	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝐾 ⊆ 𝑋)
47		eqid 2732	. . . . . . . . . . . . . 14 ⊢ (inv_g‘𝐺) = (inv_g‘𝐺)
48	21, 47, 39, 2	eqgval 19059	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ Grp ∧ 𝐾 ⊆ 𝑋) → (𝐶 ∼ 𝑧 ↔ (𝐶 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((inv_g‘𝐺)‘𝐶) + 𝑧) ∈ 𝐾)))
49	33, 46, 48	syl2anc 584	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝐶 ∼ 𝑧 ↔ (𝐶 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((inv_g‘𝐺)‘𝐶) + 𝑧) ∈ 𝐾)))
50	49	3ad2ant1 1133	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝐶 ∼ 𝑧 ↔ (𝐶 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((inv_g‘𝐺)‘𝐶) + 𝑧) ∈ 𝐾)))
51	50	biimpa 477	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (𝐶 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((inv_g‘𝐺)‘𝐶) + 𝑧) ∈ 𝐾))
52	51	simp2d 1143	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → 𝑧 ∈ 𝑋)
53	21, 39	grpcl 18829	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝐵 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → (𝐵 + 𝑧) ∈ 𝑋)
54	43, 44, 52, 53	syl3anc 1371	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (𝐵 + 𝑧) ∈ 𝑋)
55	21, 47	grpinvcl 18874	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ Grp ∧ (𝐵 + 𝐶) ∈ 𝑋) → ((inv_g‘𝐺)‘(𝐵 + 𝐶)) ∈ 𝑋)
56	34, 41, 55	syl2anc 584	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((inv_g‘𝐺)‘(𝐵 + 𝐶)) ∈ 𝑋)
57	56	adantr 481	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → ((inv_g‘𝐺)‘(𝐵 + 𝐶)) ∈ 𝑋)
58	21, 39	grpass 18830	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ (((inv_g‘𝐺)‘(𝐵 + 𝐶)) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → ((((inv_g‘𝐺)‘(𝐵 + 𝐶)) + 𝐵) + 𝑧) = (((inv_g‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)))
59	43, 57, 44, 52, 58	syl13anc 1372	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → ((((inv_g‘𝐺)‘(𝐵 + 𝐶)) + 𝐵) + 𝑧) = (((inv_g‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)))
60	21, 39, 47	grpinvadd 18903	. . . . . . . . . . . . . . . 16 ⊢ ((𝐺 ∈ Grp ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → ((inv_g‘𝐺)‘(𝐵 + 𝐶)) = (((inv_g‘𝐺)‘𝐶) + ((inv_g‘𝐺)‘𝐵)))
61	34, 38, 4, 60	syl3anc 1371	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((inv_g‘𝐺)‘(𝐵 + 𝐶)) = (((inv_g‘𝐺)‘𝐶) + ((inv_g‘𝐺)‘𝐵)))
62	21, 47	grpinvcl 18874	. . . . . . . . . . . . . . . . 17 ⊢ ((𝐺 ∈ Grp ∧ 𝐶 ∈ 𝑋) → ((inv_g‘𝐺)‘𝐶) ∈ 𝑋)
63	34, 4, 62	syl2anc 584	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((inv_g‘𝐺)‘𝐶) ∈ 𝑋)
64		eqid 2732	. . . . . . . . . . . . . . . . 17 ⊢ (-_g‘𝐺) = (-_g‘𝐺)
65	21, 39, 47, 64	grpsubval 18872	. . . . . . . . . . . . . . . 16 ⊢ ((((inv_g‘𝐺)‘𝐶) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (((inv_g‘𝐺)‘𝐶)(-_g‘𝐺)𝐵) = (((inv_g‘𝐺)‘𝐶) + ((inv_g‘𝐺)‘𝐵)))
66	63, 38, 65	syl2anc 584	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (((inv_g‘𝐺)‘𝐶)(-_g‘𝐺)𝐵) = (((inv_g‘𝐺)‘𝐶) + ((inv_g‘𝐺)‘𝐵)))
67	61, 66	eqtr4d 2775	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((inv_g‘𝐺)‘(𝐵 + 𝐶)) = (((inv_g‘𝐺)‘𝐶)(-_g‘𝐺)𝐵))
68	67	oveq1d 7426	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (((inv_g‘𝐺)‘(𝐵 + 𝐶)) + 𝐵) = ((((inv_g‘𝐺)‘𝐶)(-_g‘𝐺)𝐵) + 𝐵))
69	21, 39, 64	grpnpcan 18917	. . . . . . . . . . . . . 14 ⊢ ((𝐺 ∈ Grp ∧ ((inv_g‘𝐺)‘𝐶) ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((((inv_g‘𝐺)‘𝐶)(-_g‘𝐺)𝐵) + 𝐵) = ((inv_g‘𝐺)‘𝐶))
70	34, 63, 38, 69	syl3anc 1371	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((((inv_g‘𝐺)‘𝐶)(-_g‘𝐺)𝐵) + 𝐵) = ((inv_g‘𝐺)‘𝐶))
71	68, 70	eqtrd 2772	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (((inv_g‘𝐺)‘(𝐵 + 𝐶)) + 𝐵) = ((inv_g‘𝐺)‘𝐶))
72	71	oveq1d 7426	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((((inv_g‘𝐺)‘(𝐵 + 𝐶)) + 𝐵) + 𝑧) = (((inv_g‘𝐺)‘𝐶) + 𝑧))
73	72	adantr 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → ((((inv_g‘𝐺)‘(𝐵 + 𝐶)) + 𝐵) + 𝑧) = (((inv_g‘𝐺)‘𝐶) + 𝑧))
74	59, 73	eqtr3d 2774	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (((inv_g‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)) = (((inv_g‘𝐺)‘𝐶) + 𝑧))
75	51	simp3d 1144	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (((inv_g‘𝐺)‘𝐶) + 𝑧) ∈ 𝐾)
76	74, 75	eqeltrd 2833	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (((inv_g‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)) ∈ 𝐾)
77	21, 47, 39, 2	eqgval 19059	. . . . . . . . . . 11 ⊢ ((𝐺 ∈ Grp ∧ 𝐾 ⊆ 𝑋) → ((𝐵 + 𝐶) ∼ (𝐵 + 𝑧) ↔ ((𝐵 + 𝐶) ∈ 𝑋 ∧ (𝐵 + 𝑧) ∈ 𝑋 ∧ (((inv_g‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)) ∈ 𝐾)))
78	33, 46, 77	syl2anc 584	. . . . . . . . . 10 ⊢ (𝜑 → ((𝐵 + 𝐶) ∼ (𝐵 + 𝑧) ↔ ((𝐵 + 𝐶) ∈ 𝑋 ∧ (𝐵 + 𝑧) ∈ 𝑋 ∧ (((inv_g‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)) ∈ 𝐾)))
79	78	3ad2ant1 1133	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((𝐵 + 𝐶) ∼ (𝐵 + 𝑧) ↔ ((𝐵 + 𝐶) ∈ 𝑋 ∧ (𝐵 + 𝑧) ∈ 𝑋 ∧ (((inv_g‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)) ∈ 𝐾)))
80	79	adantr 481	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → ((𝐵 + 𝐶) ∼ (𝐵 + 𝑧) ↔ ((𝐵 + 𝐶) ∈ 𝑋 ∧ (𝐵 + 𝑧) ∈ 𝑋 ∧ (((inv_g‘𝐺)‘(𝐵 + 𝐶)) + (𝐵 + 𝑧)) ∈ 𝐾)))
81	42, 54, 76, 80	mpbir3and 1342	. . . . . . 7 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (𝐵 + 𝐶) ∼ (𝐵 + 𝑧))
82		ovex 7444	. . . . . . . 8 ⊢ (𝐵 + 𝑧) ∈ V
83		ovex 7444	. . . . . . . 8 ⊢ (𝐵 + 𝐶) ∈ V
84	82, 83	elec 8749	. . . . . . 7 ⊢ ((𝐵 + 𝑧) ∈ [(𝐵 + 𝐶)] ∼ ↔ (𝐵 + 𝐶) ∼ (𝐵 + 𝑧))
85	81, 84	sylibr 233	. . . . . 6 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝐶 ∼ 𝑧) → (𝐵 + 𝑧) ∈ [(𝐵 + 𝐶)] ∼ )
86	30, 85	syldan 591	. . . . 5 ⊢ (((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) ∧ 𝑧 ∈ [𝐶] ∼ ) → (𝐵 + 𝑧) ∈ [(𝐵 + 𝐶)] ∼ )
87	86	fmpttd 7116	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ ⟶[(𝐵 + 𝐶)] ∼ )
88	87	frnd 6725	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ⊆ [(𝐵 + 𝐶)] ∼ )
89		eqid 2732	. . . . . . . . . . 11 ⊢ (𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) = (𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧))
90	21, 39, 89	grplmulf1o 18899	. . . . . . . . . 10 ⊢ ((𝐺 ∈ Grp ∧ 𝐵 ∈ 𝑋) → (𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)):𝑋–1-1-onto→𝑋)
91	34, 38, 90	syl2anc 584	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)):𝑋–1-1-onto→𝑋)
92		f1of1 6832	. . . . . . . . 9 ⊢ ((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)):𝑋–1-1-onto→𝑋 → (𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)):𝑋–1-1→𝑋)
93	91, 92	syl 17	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)):𝑋–1-1→𝑋)
94	23	ecss 8751	. . . . . . . . 9 ⊢ (𝜑 → [𝐶] ∼ ⊆ 𝑋)
95	94	3ad2ant1 1133	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → [𝐶] ∼ ⊆ 𝑋)
96		f1ssres 6795	. . . . . . . 8 ⊢ (((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)):𝑋–1-1→𝑋 ∧ [𝐶] ∼ ⊆ 𝑋) → ((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) ↾ [𝐶] ∼ ):[𝐶] ∼ –1-1→𝑋)
97	93, 95, 96	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) ↾ [𝐶] ∼ ):[𝐶] ∼ –1-1→𝑋)
98		resmpt 6037	. . . . . . . 8 ⊢ ([𝐶] ∼ ⊆ 𝑋 → ((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) ↾ [𝐶] ∼ ) = (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
99		f1eq1 6782	. . . . . . . 8 ⊢ (((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) ↾ [𝐶] ∼ ) = (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) → (((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) ↾ [𝐶] ∼ ):[𝐶] ∼ –1-1→𝑋 ↔ (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ –1-1→𝑋))
100	95, 98, 99	3syl 18	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (((𝑧 ∈ 𝑋 ↦ (𝐵 + 𝑧)) ↾ [𝐶] ∼ ):[𝐶] ∼ –1-1→𝑋 ↔ (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ –1-1→𝑋))
101	97, 100	mpbid 231	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ –1-1→𝑋)
102		f1f1orn 6844	. . . . . 6 ⊢ ((𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ –1-1→𝑋 → (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ –1-1-onto→ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
103	101, 102	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ –1-1-onto→ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
104	14	f1oen 8971	. . . . 5 ⊢ ((𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)):[𝐶] ∼ –1-1-onto→ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) → [𝐶] ∼ ≈ ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)))
105		ensym 9001	. . . . 5 ⊢ ([𝐶] ∼ ≈ ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ≈ [𝐶] ∼ )
106	103, 104, 105	3syl 18	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ≈ [𝐶] ∼ )
107	20	3ad2ant1 1133	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐾 ∈ (SubGrp‘𝐺))
108	21, 2	eqgen 19063	. . . . . . 7 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ [𝐶] ∼ ∈ (𝑋 / ∼ )) → 𝐾 ≈ [𝐶] ∼ )
109	107, 6, 108	syl2anc 584	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐾 ≈ [𝐶] ∼ )
110		ensym 9001	. . . . . 6 ⊢ (𝐾 ≈ [𝐶] ∼ → [𝐶] ∼ ≈ 𝐾)
111	109, 110	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → [𝐶] ∼ ≈ 𝐾)
112		ecelqsg 8768	. . . . . . 7 ⊢ (( ∼ ∈ V ∧ (𝐵 + 𝐶) ∈ 𝑋) → [(𝐵 + 𝐶)] ∼ ∈ (𝑋 / ∼ ))
113	3, 41, 112	sylancr 587	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → [(𝐵 + 𝐶)] ∼ ∈ (𝑋 / ∼ ))
114	21, 2	eqgen 19063	. . . . . 6 ⊢ ((𝐾 ∈ (SubGrp‘𝐺) ∧ [(𝐵 + 𝐶)] ∼ ∈ (𝑋 / ∼ )) → 𝐾 ≈ [(𝐵 + 𝐶)] ∼ )
115	107, 113, 114	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → 𝐾 ≈ [(𝐵 + 𝐶)] ∼ )
116		entr 9004	. . . . 5 ⊢ (([𝐶] ∼ ≈ 𝐾 ∧ 𝐾 ≈ [(𝐵 + 𝐶)] ∼ ) → [𝐶] ∼ ≈ [(𝐵 + 𝐶)] ∼ )
117	111, 115, 116	syl2anc 584	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → [𝐶] ∼ ≈ [(𝐵 + 𝐶)] ∼ )
118		entr 9004	. . . 4 ⊢ ((ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ≈ [𝐶] ∼ ∧ [𝐶] ∼ ≈ [(𝐵 + 𝐶)] ∼ ) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ≈ [(𝐵 + 𝐶)] ∼ )
119	106, 117, 118	syl2anc 584	. . 3 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ≈ [(𝐵 + 𝐶)] ∼ )
120		fisseneq 9259	. . 3 ⊢ (([(𝐵 + 𝐶)] ∼ ∈ Fin ∧ ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ⊆ [(𝐵 + 𝐶)] ∼ ∧ ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) ≈ [(𝐵 + 𝐶)] ∼ ) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) = [(𝐵 + 𝐶)] ∼ )
121	26, 88, 119, 120	syl3anc 1371	. 2 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → ran (𝑧 ∈ [𝐶] ∼ ↦ (𝐵 + 𝑧)) = [(𝐵 + 𝐶)] ∼ )
122	18, 121	eqtrd 2772	1 ⊢ ((𝜑 ∧ 𝐵 ∈ 𝐻 ∧ 𝐶 ∈ 𝑋) → (𝐵 · [𝐶] ∼ ) = [(𝐵 + 𝐶)] ∼ )

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 Vcvv 3474 ⊆ wss 3948 class class class wbr 5148 ↦ cmpt 5231 ran crn 5677 ↾ cres 5678 –1-1→wf1 6540 –1-1-onto→wf1o 6542 ‘cfv 6543 (class class class)co 7411 ∈ cmpo 7413 Er wer 8702 [cec 8703 / cqs 8704 ≈ cen 8938 Fincfn 8941 Basecbs 17146 +_gcplusg 17199 Grpcgrp 18821 inv_gcminusg 18822 -_gcsg 18823 SubGrpcsubg 19002 ~_QG cqg 19004

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-er 8705 df-ec 8707 df-qs 8711 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-pnf 11252 df-mnf 11253 df-xr 11254 df-ltxr 11255 df-le 11256 df-sub 11448 df-neg 11449 df-nn 12215 df-2 12277 df-sets 17099 df-slot 17117 df-ndx 17129 df-base 17147 df-ress 17176 df-plusg 17212 df-0g 17389 df-mgm 18563 df-sgrp 18612 df-mnd 18628 df-grp 18824 df-minusg 18825 df-sbg 18826 df-subg 19005 df-eqg 19007

This theorem is referenced by: sylow2blem2 19491 sylow2blem3 19492

W3C validator