Theorem eqger 18806

Description: The subgroup coset equivalence relation is an equivalence relation. (Contributed by Mario Carneiro, 13-Jan-2015.)

Hypotheses

Ref	Expression
eqger.x	⊢ 𝑋 = (Base‘𝐺)
eqger.r	⊢ ∼ = (𝐺 ~QG 𝑌)

Assertion

Ref	Expression
eqger	⊢ (𝑌 ∈ (SubGrp‘𝐺) → ∼ Er 𝑋)

Proof of Theorem eqger

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqger.r	. . . 4 ⊢ ∼ = (𝐺 ~QG 𝑌)
2	1	releqg 18803	. . 3 ⊢ Rel ∼
3	2	a1i 11	. 2 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → Rel ∼ )
4		subgrcl 18760	. . . . . 6 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp)
5		eqger.x	. . . . . . 7 ⊢ 𝑋 = (Base‘𝐺)
6	5	subgss 18756	. . . . . 6 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → 𝑌 ⊆ 𝑋)
7		eqid 2738	. . . . . . 7 ⊢ (invg‘𝐺) = (invg‘𝐺)
8		eqid 2738	. . . . . . 7 ⊢ (+g‘𝐺) = (+g‘𝐺)
9	5, 7, 8, 1	eqgval 18805	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋) → (𝑥 ∼ 𝑦 ↔ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑌)))
10	4, 6, 9	syl2anc 584	. . . . 5 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → (𝑥 ∼ 𝑦 ↔ (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑌)))
11	10	biimpa 477	. . . 4 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → (𝑥 ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑌))
12	11	simp2d 1142	. . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → 𝑦 ∈ 𝑋)
13	11	simp1d 1141	. . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → 𝑥 ∈ 𝑋)
14	4	adantr 481	. . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → 𝐺 ∈ Grp)
15	5, 7	grpinvcl 18627	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → ((invg‘𝐺)‘𝑥) ∈ 𝑋)
16	14, 13, 15	syl2anc 584	. . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → ((invg‘𝐺)‘𝑥) ∈ 𝑋)
17	5, 8, 7	grpinvadd 18653	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ ((invg‘𝐺)‘𝑥) ∈ 𝑋 ∧ 𝑦 ∈ 𝑋) → ((invg‘𝐺)‘(((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦)) = (((invg‘𝐺)‘𝑦)(+g‘𝐺)((invg‘𝐺)‘((invg‘𝐺)‘𝑥))))
18	14, 16, 12, 17	syl3anc 1370	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → ((invg‘𝐺)‘(((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦)) = (((invg‘𝐺)‘𝑦)(+g‘𝐺)((invg‘𝐺)‘((invg‘𝐺)‘𝑥))))
19	5, 7	grpinvinv 18642	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → ((invg‘𝐺)‘((invg‘𝐺)‘𝑥)) = 𝑥)
20	14, 13, 19	syl2anc 584	. . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → ((invg‘𝐺)‘((invg‘𝐺)‘𝑥)) = 𝑥)
21	20	oveq2d 7291	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → (((invg‘𝐺)‘𝑦)(+g‘𝐺)((invg‘𝐺)‘((invg‘𝐺)‘𝑥))) = (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑥))
22	18, 21	eqtrd 2778	. . . 4 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → ((invg‘𝐺)‘(((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦)) = (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑥))
23	11	simp3d 1143	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑌)
24	7	subginvcl 18764	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑌) → ((invg‘𝐺)‘(((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦)) ∈ 𝑌)
25	23, 24	syldan 591	. . . 4 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → ((invg‘𝐺)‘(((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦)) ∈ 𝑌)
26	22, 25	eqeltrrd 2840	. . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑥) ∈ 𝑌)
27	6	adantr 481	. . . 4 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → 𝑌 ⊆ 𝑋)
28	5, 7, 8, 1	eqgval 18805	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋) → (𝑦 ∼ 𝑥 ↔ (𝑦 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑥) ∈ 𝑌)))
29	14, 27, 28	syl2anc 584	. . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → (𝑦 ∼ 𝑥 ↔ (𝑦 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑥) ∈ 𝑌)))
30	12, 13, 26, 29	mpbir3and 1341	. 2 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∼ 𝑦) → 𝑦 ∼ 𝑥)
31	13	adantrr 714	. . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → 𝑥 ∈ 𝑋)
32	5, 7, 8, 1	eqgval 18805	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋) → (𝑦 ∼ 𝑧 ↔ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧) ∈ 𝑌)))
33	4, 6, 32	syl2anc 584	. . . . . 6 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → (𝑦 ∼ 𝑧 ↔ (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧) ∈ 𝑌)))
34	33	biimpa 477	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑦 ∼ 𝑧) → (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧) ∈ 𝑌))
35	34	adantrl 713	. . . 4 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → (𝑦 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧) ∈ 𝑌))
36	35	simp2d 1142	. . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → 𝑧 ∈ 𝑋)
37	4	adantr 481	. . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → 𝐺 ∈ Grp)
38	37, 31, 15	syl2anc 584	. . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → ((invg‘𝐺)‘𝑥) ∈ 𝑋)
39	12	adantrr 714	. . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → 𝑦 ∈ 𝑋)
40	5, 7	grpinvcl 18627	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝑋) → ((invg‘𝐺)‘𝑦) ∈ 𝑋)
41	37, 39, 40	syl2anc 584	. . . . . . 7 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → ((invg‘𝐺)‘𝑦) ∈ 𝑋)
42	5, 8	grpcl 18585	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ ((invg‘𝐺)‘𝑦) ∈ 𝑋 ∧ 𝑧 ∈ 𝑋) → (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧) ∈ 𝑋)
43	37, 41, 36, 42	syl3anc 1370	. . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧) ∈ 𝑋)
44	5, 8	grpass 18586	. . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (((invg‘𝐺)‘𝑥) ∈ 𝑋 ∧ 𝑦 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧) ∈ 𝑋)) → ((((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦)(+g‘𝐺)(((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧)) = (((invg‘𝐺)‘𝑥)(+g‘𝐺)(𝑦(+g‘𝐺)(((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧))))
45	37, 38, 39, 43, 44	syl13anc 1371	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → ((((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦)(+g‘𝐺)(((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧)) = (((invg‘𝐺)‘𝑥)(+g‘𝐺)(𝑦(+g‘𝐺)(((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧))))
46		eqid 2738	. . . . . . . . . 10 ⊢ (0g‘𝐺) = (0g‘𝐺)
47	5, 8, 46, 7	grprinv 18629	. . . . . . . . 9 ⊢ ((𝐺 ∈ Grp ∧ 𝑦 ∈ 𝑋) → (𝑦(+g‘𝐺)((invg‘𝐺)‘𝑦)) = (0g‘𝐺))
48	37, 39, 47	syl2anc 584	. . . . . . . 8 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → (𝑦(+g‘𝐺)((invg‘𝐺)‘𝑦)) = (0g‘𝐺))
49	48	oveq1d 7290	. . . . . . 7 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → ((𝑦(+g‘𝐺)((invg‘𝐺)‘𝑦))(+g‘𝐺)𝑧) = ((0g‘𝐺)(+g‘𝐺)𝑧))
50	5, 8	grpass 18586	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ (𝑦 ∈ 𝑋 ∧ ((invg‘𝐺)‘𝑦) ∈ 𝑋 ∧ 𝑧 ∈ 𝑋)) → ((𝑦(+g‘𝐺)((invg‘𝐺)‘𝑦))(+g‘𝐺)𝑧) = (𝑦(+g‘𝐺)(((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧)))
51	37, 39, 41, 36, 50	syl13anc 1371	. . . . . . 7 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → ((𝑦(+g‘𝐺)((invg‘𝐺)‘𝑦))(+g‘𝐺)𝑧) = (𝑦(+g‘𝐺)(((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧)))
52	5, 8, 46	grplid 18609	. . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑧 ∈ 𝑋) → ((0g‘𝐺)(+g‘𝐺)𝑧) = 𝑧)
53	37, 36, 52	syl2anc 584	. . . . . . 7 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → ((0g‘𝐺)(+g‘𝐺)𝑧) = 𝑧)
54	49, 51, 53	3eqtr3d 2786	. . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → (𝑦(+g‘𝐺)(((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧)) = 𝑧)
55	54	oveq2d 7291	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → (((invg‘𝐺)‘𝑥)(+g‘𝐺)(𝑦(+g‘𝐺)(((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧))) = (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑧))
56	45, 55	eqtrd 2778	. . . 4 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → ((((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦)(+g‘𝐺)(((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧)) = (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑧))
57		simpl 483	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → 𝑌 ∈ (SubGrp‘𝐺))
58	23	adantrr 714	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑌)
59	35	simp3d 1143	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧) ∈ 𝑌)
60	8	subgcl 18765	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝑌 ∧ (((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧) ∈ 𝑌) → ((((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦)(+g‘𝐺)(((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧)) ∈ 𝑌)
61	57, 58, 59, 60	syl3anc 1370	. . . 4 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → ((((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦)(+g‘𝐺)(((invg‘𝐺)‘𝑦)(+g‘𝐺)𝑧)) ∈ 𝑌)
62	56, 61	eqeltrrd 2840	. . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑧) ∈ 𝑌)
63	6	adantr 481	. . . 4 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → 𝑌 ⊆ 𝑋)
64	5, 7, 8, 1	eqgval 18805	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋) → (𝑥 ∼ 𝑧 ↔ (𝑥 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑧) ∈ 𝑌)))
65	37, 63, 64	syl2anc 584	. . 3 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → (𝑥 ∼ 𝑧 ↔ (𝑥 ∈ 𝑋 ∧ 𝑧 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑧) ∈ 𝑌)))
66	31, 36, 62, 65	mpbir3and 1341	. 2 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ (𝑥 ∼ 𝑦 ∧ 𝑦 ∼ 𝑧)) → 𝑥 ∼ 𝑧)
67	5, 8, 46, 7	grplinv 18628	. . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝑋) → (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) = (0g‘𝐺))
68	4, 67	sylan 580	. . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑋) → (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) = (0g‘𝐺))
69	46	subg0cl 18763	. . . . . . 7 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → (0g‘𝐺) ∈ 𝑌)
70	69	adantr 481	. . . . . 6 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑋) → (0g‘𝐺) ∈ 𝑌)
71	68, 70	eqeltrd 2839	. . . . 5 ⊢ ((𝑌 ∈ (SubGrp‘𝐺) ∧ 𝑥 ∈ 𝑋) → (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) ∈ 𝑌)
72	71	ex 413	. . . 4 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → (𝑥 ∈ 𝑋 → (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) ∈ 𝑌))
73	72	pm4.71rd 563	. . 3 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → (𝑥 ∈ 𝑋 ↔ ((((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) ∈ 𝑌 ∧ 𝑥 ∈ 𝑋)))
74	5, 7, 8, 1	eqgval 18805	. . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ⊆ 𝑋) → (𝑥 ∼ 𝑥 ↔ (𝑥 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) ∈ 𝑌)))
75	4, 6, 74	syl2anc 584	. . . 4 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → (𝑥 ∼ 𝑥 ↔ (𝑥 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) ∈ 𝑌)))
76		df-3an 1088	. . . . 5 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) ∈ 𝑌) ↔ ((𝑥 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) ∈ 𝑌))
77		anidm 565	. . . . . 6 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) ↔ 𝑥 ∈ 𝑋)
78	77	anbi2ci 625	. . . . 5 ⊢ (((𝑥 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) ∈ 𝑌) ↔ ((((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) ∈ 𝑌 ∧ 𝑥 ∈ 𝑋))
79	76, 78	bitri 274	. . . 4 ⊢ ((𝑥 ∈ 𝑋 ∧ 𝑥 ∈ 𝑋 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) ∈ 𝑌) ↔ ((((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) ∈ 𝑌 ∧ 𝑥 ∈ 𝑋))
80	75, 79	bitrdi 287	. . 3 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → (𝑥 ∼ 𝑥 ↔ ((((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑥) ∈ 𝑌 ∧ 𝑥 ∈ 𝑋)))
81	73, 80	bitr4d 281	. 2 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → (𝑥 ∈ 𝑋 ↔ 𝑥 ∼ 𝑥))
82	3, 30, 66, 81	iserd 8524	1 ⊢ (𝑌 ∈ (SubGrp‘𝐺) → ∼ Er 𝑋)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∧ w3a 1086   = wceq 1539   ∈ wcel 2106   ⊆ wss 3887   class class class wbr 5074  Rel wrel 5594  ‘cfv 6433  (class class class)co 7275   Er wer 8495  Basecbs 16912  +_gcplusg 16962  0_gc0g 17150  Grpcgrp 18577  inv_gcminusg 18578  SubGrpcsubg 18749   ~_QG cqg 18751

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-iun 4926  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-er 8498  df-en 8734  df-dom 8735  df-sdom 8736  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-nn 11974  df-2 12036  df-sets 16865  df-slot 16883  df-ndx 16895  df-base 16913  df-ress 16942  df-plusg 16975  df-0g 17152  df-mgm 18326  df-sgrp 18375  df-mnd 18386  df-grp 18580  df-minusg 18581  df-subg 18752  df-eqg 18754

This theorem is referenced by:  qusgrp  18811  qusadd  18813  lagsubg2  18817  lagsubg  18818  orbstafun  18917  orbstaval  18918  orbsta  18919  orbsta2  18920  sylow2blem1  19225  sylow2blem2  19226  sylow2blem3  19227  sylow3lem3  19234  sylow3lem4  19235  2idlcpbl  20505  qus1  20506  qusrhm  20508  quscrng  20511  zndvds  20757  cldsubg  23262  qustgpopn  23271  qustgphaus  23274  tgptsmscls  23301  qusker  31549  qusvscpbl  31551  quslmod  31554  eqg0el  31557  qusxpid  31559  qustrivr  31561  nsgqusf1olem3  31600  qsidomlem1  31628  qsidomlem2  31629