Theorem eqg0el 13732

Description: Equivalence class of a quotient group for a subgroup. (Contributed by Thierry Arnoux, 15-Jan-2024.)

Hypothesis

Ref	Expression
eqg0el.1	⊢ ∼ = (𝐺 ~QG 𝐻)

Assertion

Ref	Expression
eqg0el	⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → ([𝑋] ∼ = 𝐻 ↔ 𝑋 ∈ 𝐻))

Proof of Theorem eqg0el

Step	Hyp	Ref	Expression
1		eqid 2209	. . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺)
2		eqg0el.1	. . . . . 6 ⊢ ∼ = (𝐺 ~QG 𝐻)
3	1, 2	eqger 13727	. . . . 5 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → ∼ Er (Base‘𝐺))
4	3	adantl 277	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → ∼ Er (Base‘𝐺))
5		eqid 2209	. . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺)
6	1, 5	grpidcl 13528	. . . . 5 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ (Base‘𝐺))
7	6	adantr 276	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → (0g‘𝐺) ∈ (Base‘𝐺))
8	4, 7	erth 6696	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → ((0g‘𝐺) ∼ 𝑋 ↔ [(0g‘𝐺)] ∼ = [𝑋] ∼ ))
9	1, 2, 5	eqgid 13729	. . . . 5 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → [(0g‘𝐺)] ∼ = 𝐻)
10	9	adantl 277	. . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → [(0g‘𝐺)] ∼ = 𝐻)
11	10	eqeq1d 2218	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → ([(0g‘𝐺)] ∼ = [𝑋] ∼ ↔ 𝐻 = [𝑋] ∼ ))
12		eqcom 2211	. . . 4 ⊢ (𝐻 = [𝑋] ∼ ↔ [𝑋] ∼ = 𝐻)
13	12	a1i 9	. . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → (𝐻 = [𝑋] ∼ ↔ [𝑋] ∼ = 𝐻))
14	8, 11, 13	3bitrrd 215	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → ([𝑋] ∼ = 𝐻 ↔ (0g‘𝐺) ∼ 𝑋))
15		errel 6659	. . . 4 ⊢ ( ∼ Er (Base‘𝐺) → Rel ∼ )
16		relelec 6692	. . . 4 ⊢ (Rel ∼ → (𝑋 ∈ [(0g‘𝐺)] ∼ ↔ (0g‘𝐺) ∼ 𝑋))
17	3, 15, 16	3syl 17	. . 3 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → (𝑋 ∈ [(0g‘𝐺)] ∼ ↔ (0g‘𝐺) ∼ 𝑋))
18	17	adantl 277	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → (𝑋 ∈ [(0g‘𝐺)] ∼ ↔ (0g‘𝐺) ∼ 𝑋))
19	10	eleq2d 2279	. 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → (𝑋 ∈ [(0g‘𝐺)] ∼ ↔ 𝑋 ∈ 𝐻))
20	14, 18, 19	3bitr2d 216	1 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → ([𝑋] ∼ = 𝐻 ↔ 𝑋 ∈ 𝐻))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1375   ∈ wcel 2180   class class class wbr 4062  Rel wrel 4701  ‘cfv 5294  (class class class)co 5974   Er wer 6647  [cec 6648  Basecbs 12998  0_gc0g 13255  Grpcgrp 13499  SubGrpcsubg 13670   ~_QG cqg 13672

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-13 2182  ax-14 2183  ax-ext 2191  ax-coll 4178  ax-sep 4181  ax-pow 4237  ax-pr 4272  ax-un 4501  ax-setind 4606  ax-cnex 8058  ax-resscn 8059  ax-1cn 8060  ax-1re 8061  ax-icn 8062  ax-addcl 8063  ax-addrcl 8064  ax-mulcl 8065  ax-addcom 8067  ax-addass 8069  ax-i2m1 8072  ax-0lt1 8073  ax-0id 8075  ax-rnegex 8076  ax-pre-ltirr 8079  ax-pre-ltadd 8083

This theorem depends on definitions:  df-bi 117  df-3an 985  df-tru 1378  df-fal 1381  df-nf 1487  df-sb 1789  df-eu 2060  df-mo 2061  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ne 2381  df-nel 2476  df-ral 2493  df-rex 2494  df-reu 2495  df-rmo 2496  df-rab 2497  df-v 2781  df-sbc 3009  df-csb 3105  df-dif 3179  df-un 3181  df-in 3183  df-ss 3190  df-nul 3472  df-pw 3631  df-sn 3652  df-pr 3653  df-op 3655  df-uni 3868  df-int 3903  df-iun 3946  df-br 4063  df-opab 4125  df-mpt 4126  df-id 4361  df-xp 4702  df-rel 4703  df-cnv 4704  df-co 4705  df-dm 4706  df-rn 4707  df-res 4708  df-ima 4709  df-iota 5254  df-fun 5296  df-fn 5297  df-f 5298  df-f1 5299  df-fo 5300  df-f1o 5301  df-fv 5302  df-riota 5927  df-ov 5977  df-oprab 5978  df-mpo 5979  df-er 6650  df-ec 6652  df-pnf 8151  df-mnf 8152  df-ltxr 8154  df-inn 9079  df-2 9137  df-ndx 13001  df-slot 13002  df-base 13004  df-sets 13005  df-iress 13006  df-plusg 13089  df-0g 13257  df-mgm 13355  df-sgrp 13401  df-mnd 13416  df-grp 13502  df-minusg 13503  df-subg 13673  df-eqg 13675

This theorem is referenced by: (None)