| 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 19184 | . . . . . . 7 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (SubGrp‘𝐺)) |
| 8 | 5, 7 | eqeltrid 2865 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 𝑆 ∈ (SubGrp‘𝐺)) |
| 9 | qus0subg.e | . . . . . . 7 ⊢ ∼ = (𝐺 ~QG 𝑆) | |
| 10 | 3, 9 | eqger 19210 | . . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → ∼ Er 𝐵) |
| 11 | 8, 10 | syl 17 | . . . . 5 ⊢ (𝐺 ∈ Grp → ∼ Er 𝐵) |
| 12 | id 22 | . . . . 5 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Grp) | |
| 13 | 6 | 0nsg 19201 | . . . . . . 7 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (NrmSGrp‘𝐺)) |
| 14 | 5, 13 | eqeltrid 2865 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 𝑆 ∈ (NrmSGrp‘𝐺)) |
| 15 | eqid 2761 | . . . . . . 7 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 16 | 3, 9, 15 | eqgcpbl 19214 | . . . . . 6 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ((𝑥 ∼ 𝑝 ∧ 𝑦 ∼ 𝑞) → (𝑥(+g‘𝐺)𝑦) ∼ (𝑝(+g‘𝐺)𝑞))) |
| 17 | 14, 16 | syl 17 | . . . . 5 ⊢ (𝐺 ∈ Grp → ((𝑥 ∼ 𝑝 ∧ 𝑦 ∼ 𝑞) → (𝑥(+g‘𝐺)𝑦) ∼ (𝑝(+g‘𝐺)𝑞))) |
| 18 | 3, 15 | grpcl 18974 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) → (𝑝(+g‘𝐺)𝑞) ∈ 𝐵) |
| 19 | 18 | 3expb 1132 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵)) → (𝑝(+g‘𝐺)𝑞) ∈ 𝐵) |
| 20 | eqid 2761 | . . . . 5 ⊢ (+g‘𝑈) = (+g‘𝑈) | |
| 21 | 2, 4, 11, 12, 17, 19, 15, 20 | qusaddval 17574 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → ([𝑎] ∼ (+g‘𝑈)[𝑏] ∼ ) = [(𝑎(+g‘𝐺)𝑏)] ∼ ) |
| 22 | 21 | 3expb 1132 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ([𝑎] ∼ (+g‘𝑈)[𝑏] ∼ ) = [(𝑎(+g‘𝐺)𝑏)] ∼ ) |
| 23 | 6, 5, 3, 9 | eqg0subgecsn 19229 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ 𝐵) → [𝑎] ∼ = {𝑎}) |
| 24 | 23 | adantrr 727 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [𝑎] ∼ = {𝑎}) |
| 25 | 6, 5, 3, 9 | eqg0subgecsn 19229 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑏 ∈ 𝐵) → [𝑏] ∼ = {𝑏}) |
| 26 | 25 | adantrl 726 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [𝑏] ∼ = {𝑏}) |
| 27 | 24, 26 | oveq12d 7409 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ([𝑎] ∼ (+g‘𝑈)[𝑏] ∼ ) = ({𝑎} (+g‘𝑈){𝑏})) |
| 28 | 3, 15 | grpcl 18974 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝐺)𝑏) ∈ 𝐵) |
| 29 | 28 | 3expb 1132 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝐺)𝑏) ∈ 𝐵) |
| 30 | 6, 5, 3, 9 | eqg0subgecsn 19229 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎(+g‘𝐺)𝑏) ∈ 𝐵) → [(𝑎(+g‘𝐺)𝑏)] ∼ = {(𝑎(+g‘𝐺)𝑏)}) |
| 31 | 29, 30 | syldan 600 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [(𝑎(+g‘𝐺)𝑏)] ∼ = {(𝑎(+g‘𝐺)𝑏)}) |
| 32 | 22, 27, 31 | 3eqtr3d 2804 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ({𝑎} (+g‘𝑈){𝑏}) = {(𝑎(+g‘𝐺)𝑏)}) |
| 33 | 32 | ralrimivva 3204 | 1 ⊢ (𝐺 ∈ Grp → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ({𝑎} (+g‘𝑈){𝑏}) = {(𝑎(+g‘𝐺)𝑏)}) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 399 = wceq 1559 ∈ wcel 2141 ∀wral 3075 {csn 4579 class class class wbr 5097 ‘cfv 6516 (class class class)co 7391 Er wer 8669 [cec 8670 Basecbs 17236 +gcplusg 17277 0gc0g 17459 /s cqus 17526 Grpcgrp 18966 SubGrpcsubg 19153 NrmSGrpcnsg 19154 ~QG cqg 19155 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-tp 4584 df-op 4586 df-uni 4863 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-1o 8431 df-er 8672 df-ec 8674 df-qs 8678 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-sup 9382 df-inf 9383 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-nn 12205 df-2 12274 df-3 12275 df-4 12276 df-5 12277 df-6 12278 df-7 12279 df-8 12280 df-9 12281 df-n0 12476 df-z 12563 df-dec 12683 df-uz 12834 df-fz 13507 df-struct 17174 df-sets 17191 df-slot 17209 df-ndx 17221 df-base 17237 df-ress 17258 df-plusg 17290 df-mulr 17291 df-sca 17293 df-vsca 17294 df-ip 17295 df-tset 17296 df-ple 17297 df-ds 17299 df-0g 17461 df-imas 17529 df-qus 17530 df-mgm 18665 df-sgrp 18744 df-mnd 18760 df-submnd 18809 df-grp 18969 df-minusg 18970 df-sbg 18971 df-subg 19156 df-nsg 19157 df-eqg 19158 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |