| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > qusxpid | Structured version Visualization version GIF version | ||
| Description: The Group quotient equivalence relation for the whole group is the cartesian product, i.e. all elements are in the same equivalence class. (Contributed by Thierry Arnoux, 16-Jan-2024.) |
| Ref | Expression |
|---|---|
| qustriv.1 | ⊢ 𝐵 = (Base‘𝐺) |
| Ref | Expression |
|---|---|
| qusxpid | ⊢ (𝐺 ∈ Grp → (𝐺 ~QG 𝐵) = (𝐵 × 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | qustriv.1 | . . . 4 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | 1 | subgid 19318 | . . 3 ⊢ (𝐺 ∈ Grp → 𝐵 ∈ (SubGrp‘𝐺)) |
| 3 | eqid 2761 | . . . 4 ⊢ (𝐺 ~QG 𝐵) = (𝐺 ~QG 𝐵) | |
| 4 | 1, 3 | eqger 19370 | . . 3 ⊢ (𝐵 ∈ (SubGrp‘𝐺) → (𝐺 ~QG 𝐵) Er 𝐵) |
| 5 | errel 8711 | . . 3 ⊢ ((𝐺 ~QG 𝐵) Er 𝐵 → Rel (𝐺 ~QG 𝐵)) | |
| 6 | 2, 4, 5 | 3syl 19 | . 2 ⊢ (𝐺 ∈ Grp → Rel (𝐺 ~QG 𝐵)) |
| 7 | relxp 5669 | . . 3 ⊢ Rel (𝐵 × 𝐵) | |
| 8 | 7 | a1i 11 | . 2 ⊢ (𝐺 ∈ Grp → Rel (𝐵 × 𝐵)) |
| 9 | df-3an 1105 | . . . 4 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝐵) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝐵)) | |
| 10 | simpl 488 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝐺 ∈ Grp) | |
| 11 | eqid 2761 | . . . . . . . . 9 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 12 | 1, 11 | grpinvcl 19178 | . . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ((invg‘𝐺)‘𝑥) ∈ 𝐵) |
| 13 | 12 | adantrr 730 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((invg‘𝐺)‘𝑥) ∈ 𝐵) |
| 14 | simprr 785 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐵) | |
| 15 | eqid 2761 | . . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 16 | 1, 15 | grpcl 19132 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ ((invg‘𝐺)‘𝑥) ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝐵) |
| 17 | 10, 13, 14, 16 | syl3anc 1398 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝐵) |
| 18 | 17 | ex 418 | . . . . 5 ⊢ (𝐺 ∈ Grp → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝐵)) |
| 19 | 18 | pm4.71d 571 | . . . 4 ⊢ (𝐺 ∈ Grp → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝐵))) |
| 20 | 9, 19 | bitr4id 293 | . . 3 ⊢ (𝐺 ∈ Grp → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝐵) ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵))) |
| 21 | ssid 3953 | . . . 4 ⊢ 𝐵 ⊆ 𝐵 | |
| 22 | 1, 11, 15, 3 | eqgval 19369 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐵 ⊆ 𝐵) → (𝑥(𝐺 ~QG 𝐵)𝑦 ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝐵))) |
| 23 | 21, 22 | mpan2 704 | . . 3 ⊢ (𝐺 ∈ Grp → (𝑥(𝐺 ~QG 𝐵)𝑦 ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝐵))) |
| 24 | brxp 5700 | . . . 4 ⊢ (𝑥(𝐵 × 𝐵)𝑦 ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) | |
| 25 | 24 | a1i 11 | . . 3 ⊢ (𝐺 ∈ Grp → (𝑥(𝐵 × 𝐵)𝑦 ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵))) |
| 26 | 20, 23, 25 | 3bitr4d 314 | . 2 ⊢ (𝐺 ∈ Grp → (𝑥(𝐺 ~QG 𝐵)𝑦 ↔ 𝑥(𝐵 × 𝐵)𝑦)) |
| 27 | 6, 8, 26 | eqbrrdv 5769 | 1 ⊢ (𝐺 ∈ Grp → (𝐺 ~QG 𝐵) = (𝐵 × 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 class class class wbr 5103 × cxp 5649 Rel wrel 5656 ‘cfv 6531 (class class class)co 7412 Er wer 8698 Basecbs 17367 +gcplusg 17408 Grpcgrp 19124 invgcminusg 19125 SubGrpcsubg 19310 ~QG cqg 19312 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 |
| 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 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-er 8701 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-nn 12317 df-2 12386 df-sets 17322 df-slot 17340 df-ndx 17352 df-base 17368 df-ress 17389 df-plusg 17421 df-0g 17592 df-mgm 18796 df-sgrp 18888 df-mnd 18904 df-grp 19127 df-minusg 19128 df-subg 19313 df-eqg 19315 |
| This theorem is used by: qustriv 19376 |
| Copyright terms: Public domain | W3C validator |