| 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 19412 | . . . . . . 7 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (SubGrp‘𝐺)) |
| 8 | 5, 7 | eqeltrid 2868 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 𝑆 ∈ (SubGrp‘𝐺)) |
| 9 | qus0subg.e | . . . . . . 7 ⊢ ∼ = (𝐺 ~QG 𝑆) | |
| 10 | 3, 9 | eqger 19440 | . . . . . 6 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → ∼ Er 𝐵) |
| 11 | 8, 10 | syl 18 | . . . . 5 ⊢ (𝐺 ∈ Grp → ∼ Er 𝐵) |
| 12 | id 23 | . . . . 5 ⊢ (𝐺 ∈ Grp → 𝐺 ∈ Grp) | |
| 13 | 6 | 0nsg 19429 | . . . . . . 7 ⊢ (𝐺 ∈ Grp → { 0 } ∈ (NrmSGrp‘𝐺)) |
| 14 | 5, 13 | eqeltrid 2868 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 𝑆 ∈ (NrmSGrp‘𝐺)) |
| 15 | eqid 2763 | . . . . . . 7 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 16 | 3, 9, 15 | eqgcpbl 19444 | . . . . . 6 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ((𝑥 ∼ 𝑝 ∧ 𝑦 ∼ 𝑞) → (𝑥(+g‘𝐺)𝑦) ∼ (𝑝(+g‘𝐺)𝑞))) |
| 17 | 14, 16 | syl 18 | . . . . 5 ⊢ (𝐺 ∈ Grp → ((𝑥 ∼ 𝑝 ∧ 𝑦 ∼ 𝑞) → (𝑥(+g‘𝐺)𝑦) ∼ (𝑝(+g‘𝐺)𝑞))) |
| 18 | 3, 15 | grpcl 19202 | . . . . . 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 17775 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → ([𝑎] ∼ (+g‘𝑈)[𝑏] ∼ ) = [(𝑎(+g‘𝐺)𝑏)] ∼ ) |
| 22 | 21 | 3expb 1138 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ([𝑎] ∼ (+g‘𝑈)[𝑏] ∼ ) = [(𝑎(+g‘𝐺)𝑏)] ∼ ) |
| 23 | 6, 5, 3, 9 | eqg0subgecsn 19462 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ 𝐵) → [𝑎] ∼ = {𝑎}) |
| 24 | 23 | adantrr 730 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [𝑎] ∼ = {𝑎}) |
| 25 | 6, 5, 3, 9 | eqg0subgecsn 19462 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑏 ∈ 𝐵) → [𝑏] ∼ = {𝑏}) |
| 26 | 25 | adantrl 729 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → [𝑏] ∼ = {𝑏}) |
| 27 | 24, 26 | oveq12d 7469 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → ([𝑎] ∼ (+g‘𝑈)[𝑏] ∼ ) = ({𝑎} (+g‘𝑈){𝑏})) |
| 28 | 3, 15 | grpcl 19202 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝐺)𝑏) ∈ 𝐵) |
| 29 | 28 | 3expb 1138 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ (𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵)) → (𝑎(+g‘𝐺)𝑏) ∈ 𝐵) |
| 30 | 6, 5, 3, 9 | eqg0subgecsn 19462 | . . . 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 3209 | 1 ⊢ (𝐺 ∈ Grp → ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 ({𝑎} (+g‘𝑈){𝑏}) = {(𝑎(+g‘𝐺)𝑏)}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ∀wral 3080 {csn 4588 class class class wbr 5108 ‘cfv 6566 (class class class)co 7451 Er wer 8752 [cec 8753 Basecbs 17431 +gcplusg 17472 0gc0g 17660 /s cqus 17727 Grpcgrp 19194 SubGrpcsubg 19380 NrmSGrpcnsg 19381 ~QG cqg 19382 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-ec 8757 df-qs 8761 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 df-n0 12647 df-z 12734 df-dec 12855 df-uz 13006 df-fz 13680 df-struct 17369 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-ress 17453 df-plusg 17486 df-mulr 17487 df-sca 17489 df-vsca 17490 df-ip 17491 df-tset 17492 df-ple 17493 df-ds 17495 df-0g 17662 df-imas 17730 df-qus 17731 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-submnd 19029 df-grp 19197 df-minusg 19198 df-sbg 19199 df-subg 19383 df-nsg 19384 df-eqg 19385 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |