| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > eqg0el | GIF version | ||
| Description: Equivalence class of a quotient group for a subgroup. (Contributed by Thierry Arnoux, 15-Jan-2024.) |
| Ref | Expression |
|---|---|
| eqg0el.1 | ⊢ ∼ = (𝐺 ~QG 𝐻) |
| Ref | Expression |
|---|---|
| eqg0el | ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → ([𝑋] ∼ = 𝐻 ↔ 𝑋 ∈ 𝐻)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2238 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 2 | eqg0el.1 | . . . . . 6 ⊢ ∼ = (𝐺 ~QG 𝐻) | |
| 3 | 1, 2 | eqger 14010 | . . . . 5 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → ∼ Er (Base‘𝐺)) |
| 4 | 3 | adantl 277 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → ∼ Er (Base‘𝐺)) |
| 5 | eqid 2238 | . . . . . 6 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 6 | 1, 5 | grpidcl 13817 | . . . . 5 ⊢ (𝐺 ∈ Grp → (0g‘𝐺) ∈ (Base‘𝐺)) |
| 7 | 6 | adantr 276 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → (0g‘𝐺) ∈ (Base‘𝐺)) |
| 8 | 4, 7 | erth 6847 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → ((0g‘𝐺) ∼ 𝑋 ↔ [(0g‘𝐺)] ∼ = [𝑋] ∼ )) |
| 9 | 1, 2, 5 | eqgid 14012 | . . . . 5 ⊢ (𝐻 ∈ (SubGrp‘𝐺) → [(0g‘𝐺)] ∼ = 𝐻) |
| 10 | 9 | adantl 277 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → [(0g‘𝐺)] ∼ = 𝐻) |
| 11 | 10 | eqeq1d 2247 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → ([(0g‘𝐺)] ∼ = [𝑋] ∼ ↔ 𝐻 = [𝑋] ∼ )) |
| 12 | eqcom 2240 | . . . 4 ⊢ (𝐻 = [𝑋] ∼ ↔ [𝑋] ∼ = 𝐻) | |
| 13 | 12 | a1i 9 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → (𝐻 = [𝑋] ∼ ↔ [𝑋] ∼ = 𝐻)) |
| 14 | 8, 11, 13 | 3bitrrd 215 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → ([𝑋] ∼ = 𝐻 ↔ (0g‘𝐺) ∼ 𝑋)) |
| 15 | errel 6810 | . . . 4 ⊢ ( ∼ Er (Base‘𝐺) → Rel ∼ ) | |
| 16 | relelec 6843 | . . . 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 2308 | . 2 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → (𝑋 ∈ [(0g‘𝐺)] ∼ ↔ 𝑋 ∈ 𝐻)) |
| 20 | 14, 18, 19 | 3bitr2d 216 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ (SubGrp‘𝐺)) → ([𝑋] ∼ = 𝐻 ↔ 𝑋 ∈ 𝐻)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1402 ∈ wcel 2209 class class class wbr 4128 Rel wrel 4777 ‘cfv 5375 (class class class)co 6079 Er wer 6798 [cec 6799 Basecbs 13335 0gc0g 13593 Grpcgrp 13788 SubGrpcsubg 13953 ~QG cqg 13955 |
| 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 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4244 ax-sep 4247 ax-pow 4309 ax-pr 4344 ax-un 4576 ax-setind 4682 ax-cnex 8264 ax-resscn 8265 ax-1cn 8266 ax-1re 8267 ax-icn 8268 ax-addcl 8269 ax-addrcl 8270 ax-mulcl 8271 ax-addcom 8273 ax-addass 8275 ax-i2m1 8278 ax-0lt1 8279 ax-0id 8281 ax-rnegex 8282 ax-pre-ltirr 8285 ax-pre-ltadd 8289 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3714 df-pr 3715 df-op 3717 df-uni 3934 df-int 3969 df-iun 4012 df-br 4129 df-opab 4191 df-mpt 4192 df-id 4436 df-xp 4778 df-rel 4779 df-cnv 4780 df-co 4781 df-dm 4782 df-rn 4783 df-res 4784 df-ima 4785 df-iota 5335 df-fun 5377 df-fn 5378 df-f 5379 df-f1 5380 df-fo 5381 df-f1o 5382 df-fv 5383 df-riota 6032 df-ov 6082 df-oprab 6083 df-mpo 6084 df-er 6801 df-ec 6803 df-pnf 8356 df-mnf 8357 df-ltxr 8359 df-inn 9288 df-2 9346 df-ndx 13338 df-slot 13339 df-base 13341 df-sets 13342 df-iress 13343 df-plusg 13427 df-0g 13595 df-mgm 13659 df-sgrp 13700 df-mnd 13713 df-grp 13791 df-minusg 13792 df-subg 13956 df-eqg 13958 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |