![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > qussub | GIF version |
Description: Value of the group subtraction operation in a quotient group. (Contributed by Mario Carneiro, 18-Sep-2015.) |
Ref | Expression |
---|---|
qusgrp.h | ⊢ 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)) |
qusinv.v | ⊢ 𝑉 = (Base‘𝐺) |
qussub.p | ⊢ − = (-g‘𝐺) |
qussub.a | ⊢ 𝑁 = (-g‘𝐻) |
Ref | Expression |
---|---|
qussub | ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)𝑁[𝑌](𝐺 ~QG 𝑆)) = [(𝑋 − 𝑌)](𝐺 ~QG 𝑆)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | qusgrp.h | . . . . 5 ⊢ 𝐻 = (𝐺 /s (𝐺 ~QG 𝑆)) | |
2 | qusinv.v | . . . . 5 ⊢ 𝑉 = (Base‘𝐺) | |
3 | eqid 2189 | . . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
4 | 1, 2, 3 | quseccl 13189 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉) → [𝑋](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
5 | 4 | 3adant3 1019 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → [𝑋](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
6 | 1, 2, 3 | quseccl 13189 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑌 ∈ 𝑉) → [𝑌](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) |
7 | eqid 2189 | . . . 4 ⊢ (+g‘𝐻) = (+g‘𝐻) | |
8 | eqid 2189 | . . . 4 ⊢ (invg‘𝐻) = (invg‘𝐻) | |
9 | qussub.a | . . . 4 ⊢ 𝑁 = (-g‘𝐻) | |
10 | 3, 7, 8, 9 | grpsubval 13005 | . . 3 ⊢ (([𝑋](𝐺 ~QG 𝑆) ∈ (Base‘𝐻) ∧ [𝑌](𝐺 ~QG 𝑆) ∈ (Base‘𝐻)) → ([𝑋](𝐺 ~QG 𝑆)𝑁[𝑌](𝐺 ~QG 𝑆)) = ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆)))) |
11 | 5, 6, 10 | 3imp3i2an 1185 | . 2 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)𝑁[𝑌](𝐺 ~QG 𝑆)) = ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆)))) |
12 | eqid 2189 | . . . . 5 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
13 | 1, 2, 12, 8 | qusinv 13192 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆)) = [((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) |
14 | 13 | 3adant2 1018 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆)) = [((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) |
15 | 14 | oveq2d 5913 | . 2 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)((invg‘𝐻)‘[𝑌](𝐺 ~QG 𝑆))) = ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆))) |
16 | nsgsubg 13161 | . . . . . . 7 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺)) | |
17 | subgrcl 13135 | . . . . . . 7 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
18 | 16, 17 | syl 14 | . . . . . 6 ⊢ (𝑆 ∈ (NrmSGrp‘𝐺) → 𝐺 ∈ Grp) |
19 | 2, 12 | grpinvcl 13007 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐺)‘𝑌) ∈ 𝑉) |
20 | 18, 19 | sylan 283 | . . . . 5 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐺)‘𝑌) ∈ 𝑉) |
21 | 20 | 3adant2 1018 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ((invg‘𝐺)‘𝑌) ∈ 𝑉) |
22 | eqid 2189 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
23 | 1, 2, 22, 7 | qusadd 13190 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ ((invg‘𝐺)‘𝑌) ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) = [(𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))](𝐺 ~QG 𝑆)) |
24 | 21, 23 | syld3an3 1294 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) = [(𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))](𝐺 ~QG 𝑆)) |
25 | qussub.p | . . . . . 6 ⊢ − = (-g‘𝐺) | |
26 | 2, 22, 12, 25 | grpsubval 13005 | . . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
27 | 26 | 3adant1 1017 | . . . 4 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
28 | 27 | eceq1d 6596 | . . 3 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → [(𝑋 − 𝑌)](𝐺 ~QG 𝑆) = [(𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))](𝐺 ~QG 𝑆)) |
29 | 24, 28 | eqtr4d 2225 | . 2 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)(+g‘𝐻)[((invg‘𝐺)‘𝑌)](𝐺 ~QG 𝑆)) = [(𝑋 − 𝑌)](𝐺 ~QG 𝑆)) |
30 | 11, 15, 29 | 3eqtrd 2226 | 1 ⊢ ((𝑆 ∈ (NrmSGrp‘𝐺) ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → ([𝑋](𝐺 ~QG 𝑆)𝑁[𝑌](𝐺 ~QG 𝑆)) = [(𝑋 − 𝑌)](𝐺 ~QG 𝑆)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ w3a 980 = wceq 1364 ∈ wcel 2160 ‘cfv 5235 (class class class)co 5897 [cec 6558 Basecbs 12515 +gcplusg 12592 /s cqus 12780 Grpcgrp 12960 invgcminusg 12961 -gcsg 12962 SubGrpcsubg 13123 NrmSGrpcnsg 13124 ~QG cqg 13125 |
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 2162 ax-14 2163 ax-ext 2171 ax-coll 4133 ax-sep 4136 ax-pow 4192 ax-pr 4227 ax-un 4451 ax-setind 4554 ax-cnex 7933 ax-resscn 7934 ax-1cn 7935 ax-1re 7936 ax-icn 7937 ax-addcl 7938 ax-addrcl 7939 ax-mulcl 7940 ax-addcom 7942 ax-addass 7944 ax-i2m1 7947 ax-0lt1 7948 ax-0id 7950 ax-rnegex 7951 ax-pre-ltirr 7954 ax-pre-lttrn 7956 ax-pre-ltadd 7958 |
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 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-nel 2456 df-ral 2473 df-rex 2474 df-reu 2475 df-rmo 2476 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-nul 3438 df-pw 3592 df-sn 3613 df-pr 3614 df-tp 3615 df-op 3616 df-uni 3825 df-int 3860 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-id 4311 df-xp 4650 df-rel 4651 df-cnv 4652 df-co 4653 df-dm 4654 df-rn 4655 df-res 4656 df-ima 4657 df-iota 5196 df-fun 5237 df-fn 5238 df-f 5239 df-f1 5240 df-fo 5241 df-f1o 5242 df-fv 5243 df-riota 5852 df-ov 5900 df-oprab 5901 df-mpo 5902 df-1st 6166 df-2nd 6167 df-er 6560 df-ec 6562 df-qs 6566 df-pnf 8025 df-mnf 8026 df-ltxr 8028 df-inn 8951 df-2 9009 df-3 9010 df-ndx 12518 df-slot 12519 df-base 12521 df-sets 12522 df-iress 12523 df-plusg 12605 df-mulr 12606 df-0g 12766 df-iimas 12782 df-qus 12783 df-mgm 12835 df-sgrp 12880 df-mnd 12893 df-grp 12963 df-minusg 12964 df-sbg 12965 df-subg 13126 df-nsg 13127 df-eqg 13128 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |