| 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 19343 | . . 3 ⊢ (𝐺 ∈ Grp → 𝐵 ∈ (SubGrp‘𝐺)) |
| 3 | eqid 2760 | . . . 4 ⊢ (𝐺 ~QG 𝐵) = (𝐺 ~QG 𝐵) | |
| 4 | 1, 3 | eqger 19395 | . . 3 ⊢ (𝐵 ∈ (SubGrp‘𝐺) → (𝐺 ~QG 𝐵) Er 𝐵) |
| 5 | errel 8730 | . . 3 ⊢ ((𝐺 ~QG 𝐵) Er 𝐵 → Rel (𝐺 ~QG 𝐵)) | |
| 6 | 2, 4, 5 | 3syl 19 | . 2 ⊢ (𝐺 ∈ Grp → Rel (𝐺 ~QG 𝐵)) |
| 7 | relxp 5668 | . . 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 2760 | . . . . . . . . 9 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 12 | 1, 11 | grpinvcl 19203 | . . . . . . . 8 ⊢ ((𝐺 ∈ Grp ∧ 𝑥 ∈ 𝐵) → ((invg‘𝐺)‘𝑥) ∈ 𝐵) |
| 13 | 12 | adantrr 730 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → ((invg‘𝐺)‘𝑥) ∈ 𝐵) |
| 14 | simprr 785 | . . . . . . 7 ⊢ ((𝐺 ∈ Grp ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → 𝑦 ∈ 𝐵) | |
| 15 | eqid 2760 | . . . . . . . 8 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 16 | 1, 15 | grpcl 19157 | . . . . . . 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 3930 | . . . 4 ⊢ 𝐵 ⊆ 𝐵 | |
| 22 | 1, 11, 15, 3 | eqgval 19394 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐵 ⊆ 𝐵) → (𝑥(𝐺 ~QG 𝐵)𝑦 ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝐵))) |
| 23 | 21, 22 | mpan2 704 | . . 3 ⊢ (𝐺 ∈ Grp → (𝑥(𝐺 ~QG 𝐵)𝑦 ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵 ∧ (((invg‘𝐺)‘𝑥)(+g‘𝐺)𝑦) ∈ 𝐵))) |
| 24 | brxp 5699 | . . . 4 ⊢ (𝑥(𝐵 × 𝐵)𝑦 ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) | |
| 25 | 24 | a1i 11 | . . 3 ⊢ (𝐺 ∈ Grp → (𝑥(𝐵 × 𝐵)𝑦 ↔ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵))) |
| 26 | 20, 23, 25 | 3bitr4d 314 | . 2 ⊢ (𝐺 ∈ Grp → (𝑥(𝐺 ~QG 𝐵)𝑦 ↔ 𝑥(𝐵 × 𝐵)𝑦)) |
| 27 | 6, 8, 26 | eqbrrdv 5768 | 1 ⊢ (𝐺 ∈ Grp → (𝐺 ~QG 𝐵) = (𝐵 × 𝐵)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ⊆ wss 3895 class class class wbr 5102 × cxp 5648 Rel wrel 5655 ‘cfv 6538 (class class class)co 7420 Er wer 8717 Basecbs 17392 +gcplusg 17433 Grpcgrp 19149 invgcminusg 19150 SubGrpcsubg 19335 ~QG cqg 19337 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 ax-cnex 11259 ax-resscn 11260 ax-1cn 11261 ax-icn 11262 ax-addcl 11263 ax-addrcl 11264 ax-mulcl 11265 ax-mulrcl 11266 ax-mulcom 11267 ax-addass 11268 ax-mulass 11269 ax-distr 11270 ax-i2m1 11271 ax-1ne0 11272 ax-1rid 11273 ax-rnegex 11274 ax-rrecex 11275 ax-cnre 11276 ax-pre-lttri 11277 ax-pre-lttrn 11278 ax-pre-ltadd 11279 ax-pre-mulgt0 11280 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-2nd 8002 df-frecs 8302 df-wrecs 8333 df-recs 8382 df-rdg 8421 df-er 8720 df-en 8977 df-dom 8978 df-sdom 8979 df-pnf 11348 df-mnf 11349 df-xr 11350 df-ltxr 11351 df-le 11352 df-sub 11546 df-neg 11547 df-nn 12339 df-2 12408 df-sets 17347 df-slot 17365 df-ndx 17377 df-base 17393 df-ress 17414 df-plusg 17446 df-0g 17617 df-mgm 18821 df-sgrp 18913 df-mnd 18929 df-grp 19152 df-minusg 19153 df-subg 19338 df-eqg 19340 |
| This theorem is used by: qustriv 19401 |
| Copyright terms: Public domain | W3C validator |