![]() |
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 13275 | . . . . . . 7 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺)) | |
2 | subgrcl 13249 | . . . . . . 7 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
3 | 1, 2 | syl 14 | . . . . . 6 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp) |
4 | eqid 2193 | . . . . . . 7 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
5 | qus0.p | . . . . . . 7 ⊢ 0 = (0g‘𝐺) | |
6 | 4, 5 | grpidcl 13101 | . . . . . 6 ⊢ (𝐺 ∈ Grp → 0 ∈ (Base‘𝐺)) |
7 | 3, 6 | syl 14 | . . . . 5 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 0 ∈ (Base‘𝐺)) |
8 | qusgrp.h | . . . . . 6 ⊢ 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)) | |
9 | eqid 2193 | . . . . . 6 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
10 | eqid 2193 | . . . . . 6 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
11 | 8, 4, 9, 10 | qusadd 13304 | . . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 0 ∈ (Base‘𝐺) ∧ 0 ∈ (Base‘𝐺)) → ([ 0 ](𝐺 ~QG 𝑆)(+g‘𝐻)[ 0 ](𝐺 ~QG 𝑆)) = [( 0 (+g‘𝐺) 0 )](𝐺 ~QG 𝑆)) |
12 | 7, 7, 11 | mpd3an23 1350 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ([ 0 ](𝐺 ~QG 𝑆)(+g‘𝐻)[ 0 ](𝐺 ~QG 𝑆)) = [( 0 (+g‘𝐺) 0 )](𝐺 ~QG 𝑆)) |
13 | 4, 9, 5 | grplid 13103 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 0 ∈ (Base‘𝐺)) → ( 0 (+g‘𝐺) 0 ) = 0 ) |
14 | 3, 7, 13 | syl2anc 411 | . . . . 5 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ( 0 (+g‘𝐺) 0 ) = 0 ) |
15 | 14 | eceq1d 6623 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → [( 0 (+g‘𝐺) 0 )](𝐺 ~QG 𝑆) = [ 0 ](𝐺 ~QG 𝑆)) |
16 | 12, 15 | eqtrd 2226 | . . 3 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → ([ 0 ](𝐺 ~QG 𝑆)(+g‘𝐻)[ 0 ](𝐺 ~QG 𝑆)) = [ 0 ](𝐺 ~QG 𝑆)) |
17 | 8 | qusgrp 13302 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐻 ∈ Grp) |
18 | eqid 2193 | . . . . . 6 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
19 | 8, 4, 18 | quseccl 13303 | . . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 0 ∈ (Base‘𝐺)) → [ 0 ](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
20 | 7, 19 | mpdan 421 | . . . 4 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → [ 0 ](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
21 | eqid 2193 | . . . . 5 ⊢ (0g‘𝐻) = (0g‘𝐻) | |
22 | 18, 10, 21 | grpid 13111 | . . . 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 2199 | 1 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → [ 0 ](𝐺 ~QG 𝑆) = (0g‘𝐻)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 105 = wceq 1364 ∈ wcel 2164 ‘cfv 5254 (class class class)co 5918 [cec 6585 Basecbs 12618 +gcplusg 12695 0gc0g 12867 /s cqus 12883 Grpcgrp 13072 SubGrpcsubg 13237 NrmSGrpcnsg 13238 ~QG cqg 13239 |
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 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4144 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-addcom 7972 ax-addass 7974 ax-i2m1 7977 ax-0lt1 7978 ax-0id 7980 ax-rnegex 7981 ax-pre-ltirr 7984 ax-pre-lttrn 7986 ax-pre-ltadd 7988 |
This theorem depends on definitions: df-bi 117 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-pw 3603 df-sn 3624 df-pr 3625 df-tp 3626 df-op 3627 df-uni 3836 df-int 3871 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-f1 5259 df-fo 5260 df-f1o 5261 df-fv 5262 df-riota 5873 df-ov 5921 df-oprab 5922 df-mpo 5923 df-er 6587 df-ec 6589 df-qs 6593 df-pnf 8056 df-mnf 8057 df-ltxr 8059 df-inn 8983 df-2 9041 df-3 9042 df-ndx 12621 df-slot 12622 df-base 12624 df-sets 12625 df-iress 12626 df-plusg 12708 df-mulr 12709 df-0g 12869 df-iimas 12885 df-qus 12886 df-mgm 12939 df-sgrp 12985 df-mnd 12998 df-grp 13075 df-minusg 13076 df-subg 13240 df-nsg 13241 df-eqg 13242 |
This theorem is referenced by: qusinv 13306 |
Copyright terms: Public domain | W3C validator |