| 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 19374 | . . . . . . 7 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (SubGrp‘𝐺)) |
| 8 | 5, 7 | eqeltrid 2867 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 𝑆 ∈ (SubGrp‘𝐺)) |
| 9 | qus0subg.e | . . . . . . 7 ⊢ ∼ = (𝐺 ~QG 𝑆) | |
| 10 | 3, 9 | eqger 19402 | . . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → ∼ Er 𝐵) |
| 11 | 8, 10 | syl 18 | . . . . 5 ⊢ (𝐺 ∈ Grp → ∼ Er 𝐵) |
| 12 | id 23 | . . . . 5 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Grp) | |
| 13 | 6 | 0nsg 19391 | . . . . . . 7 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (NrmSGrp‘𝐺)) |
| 14 | 5, 13 | eqeltrid 2867 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 𝑆 ∈ (NrmSGrp‘𝐺)) |
| 15 | eqid 2763 | . . . . . . 7 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 16 | 3, 9, 15 | eqgcpbl 19406 | . . . . . 6 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ((𝑥 ∼ 𝑝 ∧ 𝑦 ∼ 𝑞) → (𝑥(+g‘𝐺)𝑦) ∼ (𝑝(+g‘𝐺)𝑞))) |
| 17 | 14, 16 | syl 18 | . . . . 5 ⊢ (𝐺 ∈ Grp → ((𝑥 ∼ 𝑝 ∧ 𝑦 ∼ 𝑞) → (𝑥(+g‘𝐺)𝑦) ∼ (𝑝(+g‘𝐺)𝑞))) |
| 18 | 3, 15 | grpcl 19164 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵) → (𝑝(+g‘𝐺)𝑞) ∈ 𝐵) |
| 19 | 18 | 3expb 1138 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ (𝑝 ∈ 𝐵 ∧ 𝑞 ∈ 𝐵)) → (𝑝(+g‘𝐺)𝑞) ∈ 𝐵) |
| 20 | eqid 2763 | . . . . 5 ⊢ (+g‘𝑈) = (+g‘𝑈) | |
| 21 | 2, 4, 11, 12, 17, 19, 15, 20 | qusaddval 17737 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → ([𝑎] ∼ (+g‘𝑈)[𝑏] ∼ ) = [(𝑎(+g‘𝐺)𝑏)] ∼ ) |
| 22 | 21 | 3expb 1138 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ([𝑎] ∼ (+g‘𝑈)[𝑏] ∼ ) = [(𝑎(+g‘𝐺)𝑏)] ∼ ) |
| 23 | 6, 5, 3, 9 | eqg0subgecsn 19424 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ 𝐵) → [𝑎] ∼ = {𝑎}) |
| 24 | 23 | adantrr 730 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [𝑎] ∼ = {𝑎}) |
| 25 | 6, 5, 3, 9 | eqg0subgecsn 19424 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑏 ∈ 𝐵) → [𝑏] ∼ = {𝑏}) |
| 26 | 25 | adantrl 729 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [𝑏] ∼ = {𝑏}) |
| 27 | 24, 26 | oveq12d 7445 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ([𝑎] ∼ (+g‘𝑈)[𝑏] ∼ ) = ({𝑎} (+g‘𝑈){𝑏})) |
| 28 | 3, 15 | grpcl 19164 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝐺)𝑏) ∈ 𝐵) |
| 29 | 28 | 3expb 1138 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝐺)𝑏) ∈ 𝐵) |
| 30 | 6, 5, 3, 9 | eqg0subgecsn 19424 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎(+g‘𝐺)𝑏) ∈ 𝐵) → [(𝑎(+g‘𝐺)𝑏)] ∼ = {(𝑎(+g‘𝐺)𝑏)}) |
| 31 | 29, 30 | syldan 603 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [(𝑎(+g‘𝐺)𝑏)] ∼ = {(𝑎(+g‘𝐺)𝑏)}) |
| 32 | 22, 27, 31 | 3eqtr3d 2806 | . 2 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ({𝑎} (+g‘𝑈){𝑏}) = {(𝑎(+g‘𝐺)𝑏)}) |
| 33 | 32 | ralrimivva 3208 | 1 ⊢ (𝐺 ∈ Grp → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ({𝑎} (+g‘𝑈){𝑏}) = {(𝑎(+g‘𝐺)𝑏)}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2146 ∀wral 3079 {csn 4587 class class class wbr 5105 ‘cfv 6546 (class class class)co 7427 Er wer 8725 [cec 8726 Basecbs 17399 +gcplusg 17440 0gc0g 17622 /s cqus 17689 Grpcgrp 19156 SubGrpcsubg 19342 NrmSGrpcnsg 19343 ~QG cqg 19344 |
| 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 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 |
| 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 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-om 7885 df-1st 8008 df-2nd 8009 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-1o 8487 df-er 8728 df-ec 8730 df-qs 8734 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-sup 9444 df-inf 9445 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-nn 12346 df-2 12415 df-3 12416 df-4 12417 df-5 12418 df-6 12419 df-7 12420 df-8 12421 df-9 12422 df-n0 12617 df-z 12704 df-dec 12825 df-uz 12976 df-fz 13650 df-struct 17337 df-sets 17354 df-slot 17372 df-ndx 17384 df-base 17400 df-ress 17421 df-plusg 17453 df-mulr 17454 df-sca 17456 df-vsca 17457 df-ip 17458 df-tset 17459 df-ple 17460 df-ds 17462 df-0g 17624 df-imas 17692 df-qus 17693 df-mgm 18828 df-sgrp 18920 df-mnd 18936 df-submnd 18991 df-grp 19159 df-minusg 19160 df-sbg 19161 df-subg 19345 df-nsg 19346 df-eqg 19347 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |