| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > qus0subgadd | Structured version Visualization version GIF version | ||
| Description: The addition in a quotient of a group by the trivial (zero) subgroup. (Contributed by AV, 26-Feb-2025.) |
| Ref | Expression |
|---|---|
| qus0subg.0 | ⊢ 0 = (0g‘𝐺) |
| qus0subg.s | ⊢ 𝑆 = { 0 } |
| qus0subg.e | ⊢ ∼ = (𝐺 ~QG 𝑆) |
| qus0subg.u | ⊢ 𝑈 = (𝐺 /s ∼ ) |
| qus0subg.b | ⊢ 𝐵 = (Base‘𝐺) |
| Ref | Expression |
|---|---|
| qus0subgadd | ⊢ (𝐺 ∈ Grp → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ({𝑎} (+g‘𝑈){𝑏}) = {(𝑎(+g‘𝐺)𝑏)}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | qus0subg.u | . . . . . 6 ⊢ 𝑈 = (𝐺 /s ∼ ) | |
| 2 | 1 | a1i 11 | . . . . 5 ⊢ (𝐺 ∈ Grp → 𝑈 = (𝐺 /s ∼ )) |
| 3 | qus0subg.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝐺) | |
| 4 | 3 | a1i 11 | . . . . 5 ⊢ (𝐺 ∈ Grp → 𝐵 = (Base‘𝐺)) |
| 5 | qus0subg.s | . . . . . . 7 ⊢ 𝑆 = { 0 } | |
| 6 | qus0subg.0 | . . . . . . . 8 ⊢ 0 = (0g‘𝐺) | |
| 7 | 6 | 0subg 19362 | . . . . . . 7 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (SubGrp‘𝐺)) |
| 8 | 5, 7 | eqeltrid 2865 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 𝑆 ∈ (SubGrp‘𝐺)) |
| 9 | qus0subg.e | . . . . . . 7 ⊢ ∼ = (𝐺 ~QG 𝑆) | |
| 10 | 3, 9 | eqger 19390 | . . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → ∼ Er 𝐵) |
| 11 | 8, 10 | syl 18 | . . . . 5 ⊢ (𝐺 ∈ Grp → ∼ Er 𝐵) |
| 12 | id 23 | . . . . 5 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Grp) | |
| 13 | 6 | 0nsg 19379 | . . . . . . 7 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (NrmSGrp‘𝐺)) |
| 14 | 5, 13 | eqeltrid 2865 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 𝑆 ∈ (NrmSGrp‘𝐺)) |
| 15 | eqid 2761 | . . . . . . 7 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 16 | 3, 9, 15 | eqgcpbl 19394 | . . . . . 6 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ((𝑥 ∼ 𝑝 ∧ 𝑦 ∼ 𝑞) → (𝑥(+g‘𝐺)𝑦) ∼ (𝑝(+g‘𝐺)𝑞))) |
| 17 | 14, 16 | syl 18 | . . . . 5 ⊢ (𝐺 ∈ Grp → ((𝑥 ∼ 𝑝 ∧ 𝑦 ∼ 𝑞) → (𝑥(+g‘𝐺)𝑦) ∼ (𝑝(+g‘𝐺)𝑞))) |
| 18 | 3, 15 | grpcl 19152 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) → (𝑝(+g‘𝐺)𝑞) ∈ 𝐵) |
| 19 | 18 | 3expb 1138 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵)) → (𝑝(+g‘𝐺)𝑞) ∈ 𝐵) |
| 20 | eqid 2761 | . . . . 5 ⊢ (+g‘𝑈) = (+g‘𝑈) | |
| 21 | 2, 4, 11, 12, 17, 19, 15, 20 | qusaddval 17725 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → ([𝑎] ∼ (+g‘𝑈)[𝑏] ∼ ) = [(𝑎(+g‘𝐺)𝑏)] ∼ ) |
| 22 | 21 | 3expb 1138 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ([𝑎] ∼ (+g‘𝑈)[𝑏] ∼ ) = [(𝑎(+g‘𝐺)𝑏)] ∼ ) |
| 23 | 6, 5, 3, 9 | eqg0subgecsn 19412 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ 𝐵) → [𝑎] ∼ = {𝑎}) |
| 24 | 23 | adantrr 730 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [𝑎] ∼ = {𝑎}) |
| 25 | 6, 5, 3, 9 | eqg0subgecsn 19412 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑏 ∈ 𝐵) → [𝑏] ∼ = {𝑏}) |
| 26 | 25 | adantrl 729 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [𝑏] ∼ = {𝑏}) |
| 27 | 24, 26 | oveq12d 7438 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ([𝑎] ∼ (+g‘𝑈)[𝑏] ∼ ) = ({𝑎} (+g‘𝑈){𝑏})) |
| 28 | 3, 15 | grpcl 19152 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝐺)𝑏) ∈ 𝐵) |
| 29 | 28 | 3expb 1138 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝐺)𝑏) ∈ 𝐵) |
| 30 | 6, 5, 3, 9 | eqg0subgecsn 19412 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎(+g‘𝐺)𝑏) ∈ 𝐵) → [(𝑎(+g‘𝐺)𝑏)] ∼ = {(𝑎(+g‘𝐺)𝑏)}) |
| 31 | 29, 30 | syldan 603 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [(𝑎(+g‘𝐺)𝑏)] ∼ = {(𝑎(+g‘𝐺)𝑏)}) |
| 32 | 22, 27, 31 | 3eqtr3d 2804 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ({𝑎} (+g‘𝑈){𝑏}) = {(𝑎(+g‘𝐺)𝑏)}) |
| 33 | 32 | ralrimivva 3206 | 1 ⊢ (𝐺 ∈ Grp → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ({𝑎} (+g‘𝑈){𝑏}) = {(𝑎(+g‘𝐺)𝑏)}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3077 {csn 4584 class class class wbr 5103 ‘cfv 6538 (class class class)co 7420 Er wer 8714 [cec 8715 Basecbs 17387 +gcplusg 17428 0gc0g 17610 /s cqus 17677 Grpcgrp 19144 SubGrpcsubg 19330 NrmSGrpcnsg 19331 ~QG cqg 19332 |
| 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-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 |
| 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-tp 4589 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 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-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-er 8717 df-ec 8719 df-qs 8723 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-sup 9434 df-inf 9435 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-nn 12336 df-2 12405 df-3 12406 df-4 12407 df-5 12408 df-6 12409 df-7 12410 df-8 12411 df-9 12412 df-n0 12607 df-z 12694 df-dec 12815 df-uz 12966 df-fz 13640 df-struct 17325 df-sets 17342 df-slot 17360 df-ndx 17372 df-base 17388 df-ress 17409 df-plusg 17441 df-mulr 17442 df-sca 17444 df-vsca 17445 df-ip 17446 df-tset 17447 df-ple 17448 df-ds 17450 df-0g 17612 df-imas 17680 df-qus 17681 df-mgm 18816 df-sgrp 18908 df-mnd 18924 df-submnd 18979 df-grp 19147 df-minusg 19148 df-sbg 19149 df-subg 19333 df-nsg 19334 df-eqg 19335 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |