| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > qus0 | GIF version | ||
| Description: Value of the group identity operation in a quotient group. (Contributed by Mario Carneiro, 18-Sep-2015.) |
| Ref | Expression |
|---|---|
| qusgrp.h | ⊢ 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)) |
| qus0.p | ⊢ 0 = (0g‘𝐺) |
| Ref | Expression |
|---|---|
| qus0 | ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → [ 0 ](𝐺 ~QG 𝑆) = (0g‘𝐻)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nsgsubg 13785 | . . . . . . 7 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 2 | subgrcl 13759 | . . . . . . 7 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 3 | 1, 2 | syl 14 | . . . . . 6 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp) |
| 4 | eqid 2229 | . . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 5 | qus0.p | . . . . . . 7 ⊢ 0 = (0g‘𝐺) | |
| 6 | 4, 5 | grpidcl 13605 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 0 ∈ (Base‘𝐺)) |
| 7 | 3, 6 | syl 14 | . . . . 5 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 0 ∈ (Base‘𝐺)) |
| 8 | qusgrp.h | . . . . . 6 ⊢ 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)) | |
| 9 | eqid 2229 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 10 | eqid 2229 | . . . . . 6 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
| 11 | 8, 4, 9, 10 | qusadd 13814 | . . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 0 ∈ (Base‘𝐺) ∧ 0 ∈ (Base‘𝐺)) → ([ 0 ](𝐺 ~QG 𝑆)(+g‘𝐻)[ 0 ](𝐺 ~QG 𝑆)) = [( 0 (+g‘𝐺) 0 )](𝐺 ~QG 𝑆)) |
| 12 | 7, 7, 11 | mpd3an23 1373 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ([ 0 ](𝐺 ~QG 𝑆)(+g‘𝐻)[ 0 ](𝐺 ~QG 𝑆)) = [( 0 (+g‘𝐺) 0 )](𝐺 ~QG 𝑆)) |
| 13 | 4, 9, 5 | grplid 13607 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 0 ∈ (Base‘𝐺)) → ( 0 (+g‘𝐺) 0 ) = 0 ) |
| 14 | 3, 7, 13 | syl2anc 411 | . . . . 5 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ( 0 (+g‘𝐺) 0 ) = 0 ) |
| 15 | 14 | eceq1d 6733 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → [( 0 (+g‘𝐺) 0 )](𝐺 ~QG 𝑆) = [ 0 ](𝐺 ~QG 𝑆)) |
| 16 | 12, 15 | eqtrd 2262 | . . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ([ 0 ](𝐺 ~QG 𝑆)(+g‘𝐻)[ 0 ](𝐺 ~QG 𝑆)) = [ 0 ](𝐺 ~QG 𝑆)) |
| 17 | 8 | qusgrp 13812 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp) |
| 18 | eqid 2229 | . . . . . 6 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 19 | 8, 4, 18 | quseccl 13813 | . . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 0 ∈ (Base‘𝐺)) → [ 0 ](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 20 | 7, 19 | mpdan 421 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → [ 0 ](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
| 21 | eqid 2229 | . . . . 5 ⊢ (0g‘𝐻) = (0g‘𝐻) | |
| 22 | 18, 10, 21 | grpid 13615 | . . . 4 ⊢ ((𝐻 ∈ Grp ∧ [ 0 ](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) → (([ 0 ](𝐺 ~QG 𝑆)(+g‘𝐻)[ 0 ](𝐺 ~QG 𝑆)) = [ 0 ](𝐺 ~QG 𝑆) ↔ (0g‘𝐻) = [ 0 ](𝐺 ~QG 𝑆))) |
| 23 | 17, 20, 22 | syl2anc 411 | . . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (([ 0 ](𝐺 ~QG 𝑆)(+g‘𝐻)[ 0 ](𝐺 ~QG 𝑆)) = [ 0 ](𝐺 ~QG 𝑆) ↔ (0g‘𝐻) = [ 0 ](𝐺 ~QG 𝑆))) |
| 24 | 16, 23 | mpbid 147 | . 2 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → (0g‘𝐻) = [ 0 ](𝐺 ~QG 𝑆)) |
| 25 | 24 | eqcomd 2235 | 1 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → [ 0 ](𝐺 ~QG 𝑆) = (0g‘𝐻)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1395 ∈ wcel 2200 ‘cfv 5324 (class class class)co 6013 [cec 6695 Basecbs 13075 +gcplusg 13153 0gc0g 13332 /s cqus 13376 Grpcgrp 13576 SubGrpcsubg 13747 NrmSGrpcnsg 13748 ~QG cqg 13749 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8116 ax-resscn 8117 ax-1cn 8118 ax-1re 8119 ax-icn 8120 ax-addcl 8121 ax-addrcl 8122 ax-mulcl 8123 ax-addcom 8125 ax-addass 8127 ax-i2m1 8130 ax-0lt1 8131 ax-0id 8133 ax-rnegex 8134 ax-pre-ltirr 8137 ax-pre-lttrn 8139 ax-pre-ltadd 8141 |
| This theorem depends on definitions: df-bi 117 df-3or 1003 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-pw 3652 df-sn 3673 df-pr 3674 df-tp 3675 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-er 6697 df-ec 6699 df-qs 6703 df-pnf 8209 df-mnf 8210 df-ltxr 8212 df-inn 9137 df-2 9195 df-3 9196 df-ndx 13078 df-slot 13079 df-base 13081 df-sets 13082 df-iress 13083 df-plusg 13166 df-mulr 13167 df-0g 13334 df-iimas 13378 df-qus 13379 df-mgm 13432 df-sgrp 13478 df-mnd 13493 df-grp 13579 df-minusg 13580 df-subg 13750 df-nsg 13751 df-eqg 13752 |
| This theorem is referenced by: qusinv 13816 |
| Copyright terms: Public domain | W3C validator |